11784471548
domain: N
Appears in sequences
- a(n) = number of partitions of n^n into distinct parts.at n=4A064682
- Number of partitions of 2^n into distinct parts.at n=8A067735
- Number of distinct partitions of n^2.at n=16A072243
- a(n) = A000009(A000009(n)).at n=29A284908
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into distinct parts.at n=40A347621