Summary of block A166
Sequences in block A166
Section titled “Sequences in block A166”-
A166012: a(n) = 2*(A000045(n)-(n mod 2)) + 1 + (n mod 2).
-
A166022: a(n) = 3*a(n-1) -2*a(n-2) -a(n-3) +3*a(n-4) -2*a(n-5) for n > 4, with initial values as shown.
-
A166025: a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n-1) for n>0.
-
A166027: a(n) = 6*a(n-2) for n > 2; a(1) = 4, a(2) = 1.
-
A166033: a(n) = 11/4 +11*n/2 + 29*(-1)^n/4.
-
A166035: a(n) = (3^n+6*(-4)^n)/7.
-
A166060: a(n) = 4*3^n - 3*2^n.
-
A166067: Fibonacci sequence beginning 1, 69.
-
A166077: a(n)=2^(n(3n-1)/2).
-
A166105: Quadratic recurrence from Sylvester’s sequence, but starting with a(0)=1 and a(1)=2.
-
A166114: a(n) = (6-(-4)^n)/5.
-
A166115: Number of isomorphism classes of complex associative algebras of dimension n.
-
A166118: Fixed points of the mapping f(x) = (x + 2^x) mod (17 + x).
-
A166122: a(n) = (7-(-5)^n)/6.
-
A166136: a(n) = n*(n+3)/2 + 7.
-
A166137: a(n) = 5*n*(n+1)/2 - 4.
-
A166138: Trisection A022998(3n+1).
-
A166143: a(n) = 3*n^2 + 3*n - 5.
-
A166144: a(n) = (11*n^2 + 11*n - 20)/2.
-
A166146: a(n) = (7*n^2 + 7*n - 12)/2.
-
A166147: a(n) = 4*n^2 + 4*n - 7.
-
A166148: a(n) = (9*n^2 + 9*n - 16)/2.
-
A166150: a(n) = 5*n^2 + 5*n - 9.
-
A166151: a(n) = (5*n^2 + 5*n - 6)/2.
-
A166154: a(n) = 7*n*(n+1)/2 - 5.
-
A166169: a(n) = Lucas(n^2) = A000204(n^2) for n >= 1.
-
A166249: a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4) for n>3, a(0)=a(1)=1, a(2)=0, a(3)=2.
-
A166260: a(n) = A089026(n) - 1.
-
A166304: Third trisection of A022998.
-
A166334: a(n) = (3*n)!/(2^n*n!).
-
A166337: a(n)=(2n+0^n)*C(4n,2n).
-
A166338: a(n) = (4*n)!/n!.
-
A166351: a(n) = (6*n)!/(3*n)!.
-
A166356: Expansion of e.g.f. 1 + x*arctanh(x), even powers only.
-
A166371: a(n) = (A166351(n))^2 = ((6*n)!/((3*n)!))^2.
-
A166384: a(n) = (5*n)!/(2*n)!.
-
A166444: a(0) = 0, a(1) = 1 and for n > 1, a(n) = sum of all previous terms.
-
A166445: Hankel transform of A025276.
-
A166446: Period 12: repeat [1,1,1,1,0,0,-1,-1,-1,-1,0,0].
-
A166447: a(n) = n*round(sqrt(n)).
-
A166450: a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 6.
-
A166464: a(n) = (3 + 2*n + 6*n^2 + 4*n^3)/3.
-
A166465: a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 5.
-
A166466: Trisection a(n) = A000265(3n).
-
A166470: a(n) = 2^F(n+1)*3^F(n), where F(n) is the n-th Fibonacci number, A000045(n).
-
A166472: a(n) = 2^F(n+2)*3^F(n+1)/12, where F(n) is the n-th Fibonacci number (A000045(n)).
-
A166481: a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 7.
-
A166486: Periodic sequence [0,1,1,1] of length 4; Characteristic function of numbers that are not multiples of 4.
-
A166514: Zig-zag function for first two columns of a matrix (take numbers in consecutive pairs).
-
A166515: Partial sum of A166514.
-
A166516: A product of consecutive doubled Fibonacci numbers.
-
A166517: a(n) = (3 + 5*(-1)^n + 6*n)/4.
-
A166519: a(n) = 1 + 2*(-1)^n + 2*n.
-
A166520: a(n) = (10*n + 11*(-1)^n + 5)/4.
-
A166521: a(n) = (6*n + 7*(-1)^n + 3)/2.
-
A166522: a(n) = 7*n - a(n-1), with a(1) = 1.
-
A166523: a(n) = 8*n - a(n-1), with n>1, a(1)=1.
-
A166524: a(n) = 9*n - a(n-1), with n>1, a(1)=1.
-
A166525: a(n) = 10*n - a(n-1), with n>1, a(1)=1.
-
A166526: a(n) = 12*n - a(n-1), with n>1, a(1)=1.
-
A166536: A product of consecutive doubled Fibonacci numbers.
-
A166539: a(n) = (10*n + 7*(-1)^n + 5)/4.
-
A166542: a(n) = 6*n - a(n-1), with n>1, a(1)=2.
-
A166544: a(n) = 7*n - a(n-1), with n>1, a(1)=2.
-
A166545: a(n) = 13*n - a(n-1), (with a(1)=13).
-
A166552: a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 4.
-
A166554: a(0)=1, a(n) = n*(a(n-1) - 1) for n>0.
-
A166598: a(n) = 5*n - a(n-1), with n>1, a(1)=5.
-
A166621: a(n) = 10*n - a(n-1), with n>1, a(1)=5.
-
A166677: a(n)= n*(a(n-1)+4), a(0)=1.
-
A166680: a(n) = n*(a(n-1)-4), a(0) = 1.
-
A166725: a(n) = (2*n+1)*25^n.
-
A166731: Positive integers with English names ending in “d”.
-
A166750: a(n) = (A001147(n))^3 = 2^(3*n)*GAMMA(n+1/2)^3/Pi^(3/2).
-
A166752: Interleave A007583 and A000012.
-
A166753: Partial sums of A166752.
-
A166754: a(n) = 4*A061547(n+1) - 3*A166753(n).
-
A166756: Number of nX2 1..3 arrays containing at least one of each value, and all equal values connected.
-
A166776: Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.
-
A166781: Number of nX3 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.
-
A166796: Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166805: Number of n X 4 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166808: Number of n X 5 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166810: Number of n X 6 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166812: Number of n X 7 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166813: Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
-
A166814: Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.
-
A166830: Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.
-
A166863: a(1)= 1; a(2)= 5; thereafter a(n)= a(n-1) + a(n-2) + 5.
-
A166873: a(n) = a(n-1) + 12*n for n > 1; a(1) = 1.
-
A166911: a(n) = (9 + 14*n + 12*n^2 + 4*n^3)/3.
-
A166914: a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 21, a(1) = 340.
-
A166917: a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 85, a(1) = 1364.
-
A166920: a(n) = 2^n - (1 + (-1)^n)/2.
-
A166925: Digital root of square of n-th triangular number.
-
A166926: A000004 preceded by 1, 2, 4.
-
A166927: a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 1, a(1) = 18.
-
A166931: Numbers n with property that n mod k is k-1 for all k = 2..9.
-
A166941: Product plus sum of four consecutive nonnegative numbers.
-
A166942: One fifth of product plus sum of five consecutive nonnegative numbers.
-
A166956: a(n) = 2^n +(-1)^n - 2.
-
A166959: Numbers congruent to (12,32) mod 44.
-
A166965: a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 1, a(1) = 19.
-
A166977: Jacobsthal-Lucas numbers A014551, except a(0) = 0.
-
A166978: a(n) = 4*( 1-(-1)^n) -2^n.
-
A166984: a(n) = 20*a(n-1) - 64*a(n-2) for n > 1; a(0) = 1, a(1) = 20.
-
A166999: a(n) = a(n-1) + a(n-1)^2 + a(n-1)^3 for n>0 with a(0)=1.