Skip to content

Summary of block A004

139 sequences
  • A004004: a(n) = (3^(2*n+1) - 8*n - 3)/16.

  • A004006: a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.

  • A004019: a(0) = 0; for n > 0, a(n) = (a(n-1) + 1)^2.

  • A004041: Scaled sums of odd reciprocals: a(n) = (2*n + 1)!!*(Sum_{k=0..n} 1/(2*k + 1)).

  • A004045: Minimal size of binary code of length n such that every vector is within distance 1 of at least 2 codewords.

  • A004047: The coding-theoretic function A(n,10,9).

  • A004054: Expansion of (1-x)/((1+x)*(1-2*x)*(1-3*x)).

  • A004068: Number of atoms in a decahedron with n shells.

  • A004079: a(n) = maximal m such that an m X n Florentine rectangle exists.

  • A004083: Numbers k such that cos(k-1) <= 0 and cos(k) > 0.

  • A004084: a(n) = n-th positive integer k such that tan(k-1) <= 0 and tan(k) > 0.

  • A004116: a(n) = floor((n^2 + 6n - 3)/4).

  • A004119: a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.

  • A004120: Expansion of (1 + x - x^5) / (1 - x)^3.

  • A004126: a(n) = n*(7*n^2 - 1)/6.

  • A004128: a(n) = Sum_{k=1..n} floor(3*n/3^k).

  • A004134: Denominators in expansion of (1-x)^{-1/4} are 2^a(n).

  • A004142: a(n) = n*(3^n - 2^n).

  • A004146: Alternate Lucas numbers - 2.

  • A004168: a(n+1) = a(n)*(a(n)+1).

  • A004171: a(n) = 2^(2n+1).

  • A004187: a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.

  • A004188: a(n) = n*(3*n^2 - 1)/2.

  • A004189: a(n) = 10*a(n-1) - a(n-2); a(0) = 0, a(1) = 1.

  • A004190: Expansion of 1/(1 - 11*x + x^2).

  • A004191: Expansion of 1/(1 - 12*x + x^2).

  • A004201: Accept one, reject one, accept two, reject two, …

  • A004231: Ackermann’s sequence: n^^n := n^n^n^…^n (with n n’s).

  • A004249: a(n) = (2^2^…^2) (with n 2’s) + 1.

  • A004252: Path sums of n-point graphs.

  • A004253: a(n) = 5*a(n-1) - a(n-2), with a(1)=1, a(2)=4.

  • A004254: a(n) = 5*a(n-1) - a(n-2) for n > 1, a(0) = 0, a(1) = 1.

  • A004255: a(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.

  • A004256: a(n) = n^2*(n+1)*(n+2)^2/6.

  • A004257: a(n) = round(log_2(n)).

  • A004258: Duplicate of A029837.

  • A004271: 1, 3 and the nonnegative even numbers.

  • A004272: 1, 3, 5 and the nonnegative even numbers.

  • A004274: 0, 2 and the odd numbers.

  • A004276: 0, 2, 4 and the odd numbers.

  • A004277: 1 together with positive even numbers.

  • A004278: 1, 3 and the positive even numbers.

  • A004279: 1, 3, 5 and the positive even numbers.

  • A004280: 2 together with the odd numbers (essentially the result of the first stage of the sieve of Eratosthenes).

  • A004281: 2, 4 and the odd numbers.

  • A004282: a(n) = n*(n+1)^2*(n+2)^2/12.

  • A004291: Expansion of (1 + 2*x + x^2)/(1 - 10*x + x^2).

  • A004292: Expansion of (1+x)^2/(1-18*x+x^2).

  • A004302: a(n) = n^2*(n+1)^2*(n+2)/12.

  • A004303: a(n) = binomial(2*n-2,n-1)/n - 2^(n-1) + n.

  • A004319: a(n) = binomial(3*n, n - 1).

  • A004320: a(n) = n*(n+1)*(n+2)^2/6.

  • A004396: One even number followed by two odd numbers.

  • A004401: Least number of edges in graph containing all trees on n nodes.

  • A004442: Natural numbers, pairs reversed: a(n) = n + (-1)^n; also Nimsum n + 1.

  • A004443: Nimsum n + 2.

  • A004444: Nimsum n + 3.

  • A004445: Nimsum n + 4.

  • A004446: a(n) = Nimsum n + 5.

  • A004447: Nimsum n + 6.

  • A004448: Nimsum n + 7.

  • A004449: Nimsum n + 8.

  • A004456: Nimsum n + 15.

  • A004457: Nimsum n + 16.

  • A004466: a(n) = n*(5*n^2 - 2)/3.

  • A004482: Tersum n + 1 (answer recorded in base 10).

  • A004523: Two even followed by one odd; or floor(2n/3).

  • A004524: Three even followed by one odd.

  • A004525: One even followed by three odd.

  • A004526: Nonnegative integers repeated, floor(n/2).

  • A004527: Ratios of successive terms are 1,2,2,3,4,4,5,6,6,…

  • A004538: a(n) = 3*n^2 + 3*n - 1.

  • A004630: Squares written in base 12. (Next term contains a non-decimal character.)

  • A004643: Powers of 2 written in base 4.

  • A004647: Powers of 2 written in base 8.

  • A004651: Powers of 2 written in base 12. (Next term contains a non-decimal character.)

  • A004652: Expansion of x*(1+x^2+x^4)/((1-x)*(1-x^2)*(1-x^3)).

  • A004663: Powers of 3 written in base 9.

  • A004664: a(n) = n! + n^2.

  • A004695: a(n) = floor(Fibonacci(n)/2).

  • A004696: a(n) = floor(Fibonacci(n)/3).

  • A004697: a(n) = floor(Fibonacci(n)/4).

  • A004698: a(n) = floor(Fibonacci(n)/5).

  • A004699: a(n) = floor(Fibonacci(n)/6).

  • A004754: Numbers n whose binary expansion starts 10.

  • A004755: Binary expansion starts 11.

  • A004757: Binary expansion starts 101.

  • A004760: List of numbers whose binary expansion does not begin 10.

  • A004761: Numbers n whose binary expansion does not begin with 11.

  • A004763: Numbers whose binary expansion does not begin 101.

  • A004766: Numbers whose binary expansion ends 01.

  • A004767: a(n) = 4*n + 3.

  • A004768: Binary expansion ends 001.

  • A004769: Numbers whose binary expansion ends in 011.

  • A004770: Numbers of the form 8k+5; or, numbers whose binary expansion ends in 101.

  • A004771: a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.

  • A004772: Numbers that are not congruent to 1 (mod 4).

  • A004773: Numbers congruent to {0, 1, 2} mod 4: a(n) = floor(4*n/3).

  • A004774: Numbers n whose binary expansion does not end in 001.

  • A004775: Numbers k such that the binary expansion of k does not end in 011.

  • A004776: Numbers not congruent to 5 (mod 8).

  • A004777: Numbers not congruent to 7 mod 8.

  • A004799: Self-convolution of Lucas numbers.

  • A004920: a(n) = floor(n*phi^5), where phi is the golden ratio, A001622.

  • A004925: a(n) = floor(n*phi^10), where phi is the golden ratio, A001622.

  • A004937: a(n) = round(n*phi^2), where phi is the golden ratio, A001622.

  • A004945: a(n) = round(n*phi^10), where phi is the golden ratio, A001622.

  • A004946: a(n) = round(n*phi^11), where phi is the golden ratio, A001622.

  • A004947: a(n) = round(n*phi^12), where phi is the golden ratio, A001622.

  • A004948: a(n) = round(n*phi^13), where phi is the golden ratio, A001622.

  • A004949: a(n) = round(n*phi^14), where phi is the golden ratio, A001622.

  • A004951: a(n) = round(n*phi^16), where phi is the golden ratio, A001622.

  • A004952: a(n) = round(n*phi^17), where phi is the golden ratio, A001622.

  • A004953: a(n) = round(n*phi^18), where phi is the golden ratio, A001622.

  • A004954: a(n) = round(n*phi^19), where phi is the golden ratio, A001622.

  • A004955: a(n) = round(n*phi^20), where phi is the golden ratio, A001622.

  • A004956: a(n) = ceiling(n*phi), where phi is the golden ratio, A001622.

  • A004957: a(n) = ceiling(n*phi^2), where phi is the golden ratio, A001622.

  • A004958: a(n) = ceiling(n*phi^3), where phi is the golden ratio, A001622.

  • A004960: a(n) = ceiling(n*phi^5), where phi is the golden ratio, A001622.

  • A004961: a(n) = ceiling(n*phi^6), where phi is the golden ratio.

  • A004964: a(n) = ceiling(n*phi^9), where phi is the golden ratio, A001622.

  • A004965: a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.

  • A004966: a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.

  • A004967: a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.

  • A004969: a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.

  • A004971: a(n) = ceiling(n*phi^16), where phi is the golden ratio, A001622.

  • A004973: a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.

  • A004975: a(n) = ceiling(n*phi^20), where phi is the golden ratio, A001622.

  • A004976: a(n) = floor(n*phi^3), where phi=(1+sqrt(5))/2.

  • A004981: a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 1).

  • A004982: a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 3).

  • A004983: a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k - 3).

  • A004984: a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k - 1).

  • A004985: a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k + 5).

  • A004986: a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 7).

  • A004987: a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k + 1). 3-central binomial coefficients.

  • A004988: a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 2).

  • A004991: a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 4).