30997

Appears in sequences

• 3n^3 - 2n^2 + n - 1.at n=21A130885
• Number of (n+5) X 8 binary arrays with every 6 X 6 subblock commuting with each horizontal and vertical neighbor 6 X 6 subblock.at n=3A186613
• Number of (n+5)X9 binary arrays with every 6X6 subblock commuting with each horizontal and vertical neighbor 6X6 subblock.at n=2A186614
• T(n,k)=Number of (n+5)X(k+5) binary arrays with every 6X6 subblock commuting with each horizontal and vertical neighbor 6X6 subblock.at n=17A186619
• T(n,k)=Number of (n+5)X(k+5) binary arrays with every 6X6 subblock commuting with each horizontal and vertical neighbor 6X6 subblock.at n=18A186619
• Centered 36-gonal numbers.at n=41A195316
• a(n) = Sum_{k=0..n} p(k)*q(k), where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).at n=17A265096
• Regular triangle read by rows where T(n,k) is the number of labeled simple graphs on n vertices where all non-isolated vertices have degree k.at n=42A319729
• Number of separable partitions of n in which the number of distinct (repeatable) parts is > 3.at n=40A325718
• Number of sets of nonempty subsets of {1..n} contradicting a strict version of the axiom of choice.at n=4A367903
• Number of subsets of {1..n} containing n such that it is not possible to choose a different binary index of each element.at n=16A370589
• Number of subsets of {1..n} such that it is not possible to choose a different binary index of each element.at n=15A370637
• a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly 2 ways, or -1 if no such number exists.at n=16A374417