21988

Appears in sequences

• Cluster series for bond percolation problem on square lattice.at n=10A003198
• Number of polyiamonds with n cells, with holes.at n=15A070764
• Number of nX2 0..7 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=5A203437
• Number of nX6 0..7 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=1A203441
• T(n,k)=Number of nXk 0..7 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=22A203443
• T(n,k)=Number of nXk 0..7 arrays with every nonzero element less than or equal to at least two horizontal and vertical neighbors.at n=26A203443
• Numbers n such that n^9+9 and n^9-9 are prime.at n=19A239505
• a(n) is a number of lattice points in 3D Cartesian grid between cube with edge length 2*n centered in origin and its inscribed sphere. Three pairs of the cube's faces are parallel to the planes XOY, XOZ, YOZ respectively.at n=18A303743
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero.at n=24A304225
• Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are weakly increasing.at n=16A323450
• Even composites m such that A003499(m)==6 (mod m).at n=14A338311
• Number of integer compositions of n in which runs of 1's all have length <= 1, runs of 2's all have length <= 2, runs of 3's all have length <= 3, etc.at n=18A389510