Summary of block A224
Sequences in block A224
Section titled “Sequences in block A224”-
A224141: Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.
-
A224317: a(n) = a(n-1) + 3 - a(n-1)!.
-
A224327: Number of idempotent n X n 0..2 matrices of rank n-1.
-
A224328: Number of idempotent n X n 0..3 matrices of rank n-1.
-
A224329: Number of idempotent n X n 0..4 matrices of rank n-1.
-
A224330: Number of idempotent n X n 0..5 matrices of rank n-1.
-
A224331: Number of idempotent n X n 0..6 matrices of rank n-1.
-
A224332: Number of idempotent n X n 0..7 matrices of rank n-1.
-
A224334: Number of idempotent 3 X 3 0..n matrices of rank 2.
-
A224335: Number of idempotent 4X4 0..n matrices of rank 3.
-
A224336: Number of idempotent 5 X 5 0..n matrices of rank 4.
-
A224337: Number of idempotent 6X6 0..n matrices of rank 5.
-
A224384: a(n) = 1 + 17^n.
-
A224421: The indices of tetrahedral numbers that are also triangular.
-
A224454: The Wiener index of the linear phenylene with n hexagons.
-
A224508: a(n+2) = a(n+1) + a(n) + A*t^n, with A = 1 and t = -2.
-
A224520: Numbers a(n) with property a(n) + a(n+4) = 2^(n+4) - 1 = A000225(n+4).
-
A224521: Numbers a(n) with property a(n) + a(n+5) = 2^(n+5) - 1 = A000225(n+5).
-
A224535: Odd numbers that are the sum of three distinct prime numbers.
-
A224666: Number of 4 X 4 0..n matrices with each 2 X 2 subblock idempotent.
-
A224667: Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.
-
A224669: Number of (n+1) X 2 0..2 matrices with each 2 X 2 subblock idempotent.
-
A224707: Number of different patterns using tiles from 1*1 to 1*n with each tile flush or diagonal to at least one other.
-
A224746: a(n) = (Product_{d=1..n-1} (2^d-1)) mod (2^n-1).
-
A224779: One half of the even numbers that are a primitive sum of four nonzero squares at least once.
-
A224783: Denominator of Bernoulli(n,1/2) - Bernoulli(n,0).
-
A224790: a(n) = 3*9^n + 8.
-
A224868: a(1) = greatest k such that H(k) - H(4) < 1/3 + 1/4; a(2) = greatest k such that H(k) - H(a(1)) < H(a(1)) - H(4); and for n > 2, a(n) = greatest k such that H(k) - H(a(n-1)) > H(a(n-1)) - H(a(n-2)), where H = harmonic number.
-
A224869: a(n) = n*( a(n-1)+1 ), initialized by a(1) = -1.
-
A224886: Number of unlabeled tournaments which do not contain a transitive n-tournament.
-
A224900: a(n) = n!*((n+1)!)^2.
-
A224995: Floor(1/f(x^(1/n))) for x = 3/2, where f computes the fractional part.
-
A224996: a(n) = floor(1/f(x^(1/n))) for x = 2, where f computes the fractional part.
-
A224999: Duplicate of A001651.