Summary of block A162
Sequences in block A162
Section titled “Sequences in block A162”-
A162024: Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and all but the outermost row or column zero.
-
A162147: a(n) = n*(n+1)*(5*n + 4)/6.
-
A162148: a(n) = n*(n+1)*(5*n+7)/6.
-
A162185: a(0)=3 and a(n+1)=2^a(n).
-
A162187: a(0)=4 and a(n+1)=a(n)!
-
A162213: a(n) = the smallest positive multiple of n with exactly n digits when written in binary.
-
A162214: a(n) = the largest positive multiple of n with exactly n digits when written in binary.
-
A162254: a(n) = n*(2*n^2 + 5*n + 1)/2.
-
A162255: a(n) = 2*a(n-2) for n > 2; a(1) = 3, a(2) = 2.
-
A162256: a(n) = (2*n^3 + 5*n^2 - 3*n)/2.
-
A162257: a(n) = (2*n^3 + 5*n^2 - 11*n)/2.
-
A162258: a(n) = (2*n^3 + 5*n^2 - 9*n)/2.
-
A162260: a(n) = (n^3 + 4*n^2 - n)/2.
-
A162261: a(n) = (2*n^3 + 5*n^2 - 7*n)/2.
-
A162262: a(n) = (2*n^3 + 5*n^2 - 13*n)/2.
-
A162263: a(n) = (2*n^3 + 5*n^2 + 11*n)/2.
-
A162264: a(n) = (2*n^3 + 5*n^2 + 7*n)/2.
-
A162265: a(n) = (2*n^3 + 5*n^2 - 5*n)/2.
-
A162266: a(n) = (2*n^3 + 5*n^2 + 21*n)/2.
-
A162267: a(n) = (2*n^3 + 5*n^2 + 5*n)/2.
-
A162268: a(n) = ((5+sqrt(2))*(1+sqrt(2))^n + (5-sqrt(2))*(1-sqrt(2))^n)/2.
-
A162269: a(n) = ((5+sqrt(2))*(2+sqrt(2))^n + (5-sqrt(2))*(2-sqrt(2))^n)/2.
-
A162271: a(n) = ((5+sqrt(2))*(4+sqrt(2))^n + (5-sqrt(2))*(4-sqrt(2))^n)/2.
-
A162272: a(n) = ((1+sqrt(3))*(5+sqrt(3))^n + (1-sqrt(3))*(5-sqrt(3))^n)/2.
-
A162273: a(n) = ((2+sqrt(3))*(3+sqrt(3))^n + (2-sqrt(3))*(3-sqrt(3))^n)/2.
-
A162274: a(n) = ((2+sqrt(3))*(4+sqrt(3))^n + (2-sqrt(3))*(4-sqrt(3))^n)/2.
-
A162275: a(n) = 10*a(n-1) - 22*a(n-2) for n > 1; a(0) = 2, a(1) = 13.
-
A162285: Periodic length 8 sequence [1, -1, -1, 1, -1, 1, 1, -1, …].
-
A162316: a(n) = 5*n^2 + 20*n + 1.
-
A162330: Blocks of 4 numbers of the form 2k, 2k-1, 2k, 2k+1, k=1,2,3,4,…
-
A162356: a(n) = 8*a(n-1)-14*a(n-2) for n>1; a(0) = 2; a(1) = 9.
-
A162395: a(n) = -(-1)^n * n^2.
-
A162396: a(n) = 2*a(n-2) for n > 2; a(1) = 5, a(2) = 2.
-
A162397: a(n) = n * Kronecker(-3, n).
-
A162414: a(0)=3 and a(n+1)=a(n)^a(n).
-
A162436: a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 3.
-
A162466: a(n) = 12*a(n-2) for n > 2; a(1) = 1, a(2) = 8.
-
A162483: a(n) is the number of perfect matchings of an edge-labeled 2 X (2n+1) Mobius grid graph.
-
A162484: a(1) = 2, a(2) = 8; a(n) = 2 a(n - 1) + a(n - 2) - 4*(n mod 2).
-
A162485: a(1)=4, a(2)=6; for n > 2, a(n) = 2*a(n-1) + a(n-2) - 4*((n-1) mod 2).
-
A162521: Magic numbers A018226 divided by 2.
-
A162540: a(n) = (2*n+1)*(2*n+3)*(2*n+5)/3.
-
A162551: a(n) = 2 * C(2*n,n-1).
-
A162557: a(n) = ((3+sqrt(3))*(4+sqrt(3))^n+(3-sqrt(3))*(4-sqrt(3))^n)/6.
-
A162558: a(n) = ((3+sqrt(3))*(5+sqrt(3))^n + (3-sqrt(3))*(5-sqrt(3))^n)/6.
-
A162559: a(n) = ((4+sqrt(3))*(1+sqrt(3))^n + (4-sqrt(3))*(1-sqrt(3))^n)/2.
-
A162562: a(n) = ((5+sqrt(3))*(1+sqrt(3))^n + (5-sqrt(3))*(1-sqrt(3))^n)/2.
-
A162563: a(n) = ((5+sqrt(3))*(2+sqrt(3))^n + (5-sqrt(3))*(2-sqrt(3))^n)/2.
-
A162570: Positive integers n such that the polynomial P(n,t) = t^{2^{n-1}} * (t+1)^{2^{n-1}-1} + 1 of GF(2)[t] is irreducible, where GF(2) = {0,1} is the binary finite field with two elements.
-
A162607: a(n) = n*(n^2 - 4*n + 5)/2.
-
A162634: Numerators of fractions with denominators A000215(n) approximating the Thue-Morse constant.
-
A162647: Numerators associated with denominators A000215(n) approximating the complementary Thue-Morse constant.
-
A162668: a(n) = n*(n+1)*(n+2)*(n+3)/3.
-
A162669: a(n) = n*(n+1)*(n+2)*(n+3)*(n+4)*(n+5)/5.
-
A162670: Expansion of x/(1 - x - 100*x^2).
-
A162673: Number of different fixed (possibly) disconnected trominoes bounded (not necessarily tightly) by an n*n square.
-
A162699: Odd numbers not divisible by 7.
-
A162725: a(n) = 8*a(n-1) - 19*a(n-2) + 12*a(n-3) (n >= 3) with a(0) = a(1) = 1, a(2) = 2.
-
A162729: a(n) = 5^n*(5^n-1)/2.
-
A162757: a(n) = 12*a(n-1)-33*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A162761: Minimal total number of floors an elevator must move to transport n people initially waiting at floors i = 1, …, n to their destination floors n-i+1 (= n, …, 1), when the elevator can hold at most one person at a time and starts at floor 1, and no passenger may get off the elevator before reaching his/her destination.
-
A162762: Minimal number of floors an elevator must move to transport n passengers initially waiting at floors i = 1, …, n to their destinations, floor n+1-i (= n, …, 1), if the elevator can transport at most C = 2 persons at a time and starts at floor 1, and no one may get off the elevator before reaching their destination.
-
A162766: a(n) = 3*a(n-2) for n > 2; a(1) = 4, a(2) = 3.
-
A162769: a(n) = ((1+sqrt(5))*(4+sqrt(5))^n + (1-sqrt(5))*(4-sqrt(5))^n)/2.
-
A162770: a(n) = ((2+sqrt(5))*(1+sqrt(5))^n + (2-sqrt(5))*(1-sqrt(5))^n)/2.
-
A162771: a(n) = ((2+sqrt(5))*(3+sqrt(5))^n + (2-sqrt(5))*(3-sqrt(5))^n)/2.
-
A162772: a(n) = ((2+sqrt(5))*(4+sqrt(5))^n + (2-sqrt(5))*(4-sqrt(5))^n)/2.
-
A162773: a(n) = ((2+sqrt(5))*(5+sqrt(5))^n + (2-sqrt(5))*(5-sqrt(5))^n)/2.
-
A162776: a(n) = A161828(n)*2/3.
-
A162813: a(n) = 3*a(n-2) for n > 2; a(1) = 5, a(2) = 3.
-
A162852: a(n) = 3*a(n-2) for n > 2; a(1) = 3, a(2) = -1.
-
A162897: a(1)=a(2)=2. a(n) = the smallest integer >= 2 such that a(n-1)^a(n) > a(n-2)^a(n-1).
-
A162940: a(n) = binomial(n+1,2)*6^2.
-
A162942: a(n) = binomial(n+1,2)*7^2.
-
A162962: a(n) = 5*a(n-2) for n > 2; a(1) = 1, a(2) = 5.
-
A162963: a(n) = 5*a(n-2) for n > 2; a(1) = 2, a(2) = 5.
-
A162968: Number of pairs of consecutive non-fixed points in all permutations of {1,2,…,n}.
-
A162991: The first right hand column of triangle A162990.
-
A162992: The second right hand column of triangle A162990.
-
A162993: The second left hand column of triangle A162990.
-
A162994: The third left hand column of triangle A162990.