21224

Appears in sequences

• Numbers that are the sum of 9 positive 9th powers.at n=13A003398
• Number of forests in Moebius ladder M_n.at n=5A020865
• a(n) = T(5,n), array T given by A048505.at n=8A048510
• Consider the tiling of the plane with squares of two different sizes as in Fig. 2.4.2(g) of Grünbaum and Shephard, p. 74. a(n) is the number of connected figures that can be formed on this tiling, from any n squares.at n=7A121197
• Eigentriangle, row sums = A144251 shifted, right border = A144251.at n=34A144252
• (A192533)/2.at n=35A192534
• Number of nX3 0..2 arrays with exactly floor(nX3/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=8A222397
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=57A222402
• Absolute discriminants of complex quadratic fields with 3-class rank 2.at n=24A242862
• Absolute discriminants of complex quadratic fields with 3-class group of elementary abelian type (3,3) of rank 2.at n=15A242863
• Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) and Hilbert 3-class field tower of exact length 2.at n=7A242864
• Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) and 3-principalization type (2241).at n=3A247689
• Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) whose second 3-class group is located on the sporadic part of the coclass graph G(3,2) outside of coclass trees.at n=10A247691
• Number of partitions of 2n into exactly 5 parts.at n=43A256309
• Number of partitions of 3n into at most 5 parts.at n=27A256525
• Number of partitions of n^2 into at most five parts.at n=9A274322
• Number of n X n 0..1 arrays with every element equal to 1, 2 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=4A301663
• Number of nX5 0..1 arrays with every element equal to 1, 2 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=4A301666
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=40A301669
• Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2*n+2, read by rows, where T(n,k) is the number of 2*(k+2*n-2)-cycles in the n X n grid graph which pass through NW and SE corners ((0,0),(n-1,n-1)).at n=12A333667