125832

Appears in sequences

• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=12A207364
• 12 times the total number of smallest parts in all partitions of n, with a(0) = 0.at n=26A211609
• Number of (3+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=7A252682
• G.f. A(x) satisfies: A(x) = x + A( x*A(x) + x*A(x)^3 ).at n=13A271843
• Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=7A317427
• a(n) is the product of n, the n-th prime and the n-th composite number.at n=27A331999