66895

Appears in sequences

• Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process.at n=23A122768
• Expansion of Product_{k>=1} (1 + x^(k^2))^(k^2).at n=58A291649
• Number of integer partitions of n such that (length) * (maximum) >= 2*n.at n=43A361906