47098

Appears in sequences

• Number of increasing sequences of Goldbach type of length n; a(0) = 1 by convention.at n=9A008932
• Number of admissible bases in the postage stamp problem for n denominations and h = 2 stamps.at n=8A167809
• Number of (n+2) X 5 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=6A202527
• Number of (n+2) X 9 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=2A202531
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=38A202532