36498

Appears in sequences

• Number of 1's in binary expansion of parts in all partitions of n.at n=27A066624
• a(n) = n*(2*n^2 + n + 1)/2.at n=32A085786
• Number of genus-2 partitions of [n].at n=4A297179
• Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A300337
• Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=2A300341
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=38A300342
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=42A300342
• Numbers k such that A073734(k) is neither squarefree nor a prime power.at n=14A365899
• Table read by rows. Number of set partitions of [n] with respect to genus g.at n=24A370235
• a(n) = Sum_{k=0..n} binomial(k+6,6) * binomial(2*k,2*n-2*k).at n=6A382473