105690

Appears in sequences

• Number of partitions of 3n into n parts from the set {0, 1, ..., 6} (repetitions admissible).at n=39A001977
• Numbers which form a prime by appending a 3-digit odd number and form no primes by appending any 1- or 2-digit odd number not beginning with 0.at n=23A091089
• Number of strictly increasing arrangements of 6 numbers in -(n+4)..(n+4) with sum zero.at n=17A188184
• Number of nX7 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207441
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=48A207442
• Number of 4Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=6A207444
• Triangular array, read by rows: T(n,k) = [(x*y*z)^k] (-1 + (1 + x + 1/x)*(1 + y + 1/y)*(1 + z + 1/z))^n for -n <= k <= n.at n=39A329819
• Triangular array, read by rows: T(n,k) = [(x*y*z)^k] (-1 + (1 + x + 1/x)*(1 + y + 1/y)*(1 + z + 1/z))^n for -n <= k <= n.at n=45A329819
• Number of edges in regular n-gon after 2 generations of mitosis.at n=23A349968