32398

Appears in sequences

• Product of twin primes minus 1.at n=12A120875
• Let f(z) = z^2 + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c.at n=54A137560
• Number of 4 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=30A188555
• Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set.at n=46A202019
• Triangle read by rows, arising in enumeration of permutations by cyclic peaks, cycles and fixed points.at n=22A216963
• Triangle read by rows, related to Bell numbers A000110: A216963 interlaced with A217202.at n=38A217205
• Number of length n+4 0..5 arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.at n=1A248998
• T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.at n=16A249001
• Number of length 2+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.at n=4A249003
• Number T(n,k) of colored set partitions of [n] where elements of subsets have distinct colors and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=38A323128
• Number of binary search trees (BST) on n nodes which have the same height as the optimal BST.at n=16A328349
• Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.at n=32A335920