47942
domain: N
Appears in sequences
- a(n) is the number of partitions of 2n that can be obtained by adding together two (not necessarily distinct) partitions of n.at n=20A002219
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among quadruples.at n=21A015653
- Number of 4's in all partitions of n.at n=41A024788
- Number of partitions of n into parts not of the form 25k, 25k+9 or 25k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=43A036008
- Total sum of squares of number of distinct parts in all partitions of n.at n=26A135348
- Number of partitions of n which can themselves be subdivided into two partitions whose sums differ by 1 at most.at n=42A276107
- Langton's ant on a three-dimensional grid: iterations where the ant passes through the origin.at n=10A308563