19723

Appears in sequences

• Convolution of odd numbers and A000201.at n=32A023658
• T(2n,n), array T given by A047010.at n=7A047019
• Greatest number, not divisible by 4, having exactly n partitions into three distinct positive squares.at n=4A096021
• Number of ways to place zero or more nonadjacent 1,0 1,1 2,1 2,2 3,1 4,1 5,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155318
• Number of 2 X 2 nonsingular 0..n matrices with a(1,1) <= a(1,2) <= a(2,1) <= a(2,2).at n=23A183763
• Numbers n such that n^2 + 2*n + 2^n is prime.at n=18A188574
• Number of (n+2)X4 binary arrays avoiding patterns 000 and 101 in rows and columns.at n=4A203085
• Number of (n+2)X7 binary arrays avoiding patterns 000 and 101 in rows and columns.at n=1A203088
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 101 in rows and columns.at n=16A203091
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 101 in rows and columns.at n=19A203091
• G.f. A(x,y) satisfies: A( x - x*y*A(x,y), y) = x + x*(1-y)*A(x,y), where the coefficients T(n,k) of x^n*y^k form a triangle read by rows n>=1, for k=0..n-1.at n=42A291820
• A diagonal of triangle A291820.at n=6A291822
• a(n) is the total number of down-steps after the final up-step in all 3_2-Dyck paths of length 4*n (n up-steps and 3*n down-steps).at n=5A334609
• The number of free kissing polyominoes with n cells.at n=12A376496