|
Search: id:A130900
|
|
|
| A130900 |
|
Number of partitions of n into {number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers} numbers. |
|
+0
3
|
|
| 1, 2, 3, 5, 6, 10, 12, 17, 22, 29, 36, 48, 58, 73, 91, 111, 134, 165, 197, 236, 283, 335, 395, 468, 547, 639, 747, 866, 1001, 1160, 1334, 1530, 1757, 2007, 2286, 2606, 2958, 3349, 3793, 4281, 4821, 5430, 6097, 6833, 7657, 8559, 9549, 10652, 11858, 13178
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The "partition transformation" of sequence A can be defined as the number of partitions of n into elements of sequence A. This sequence (A130900) is the partition transformation composed with itself five times on the positive integers.
|
|
EXAMPLE
|
a(6)=10 because there are 10 partitions of 6 whose parts are 1,2,3,4,6 which are terms of sequence A130899, which is the number of partitions of n into numbers of partitions of n into numbers of partitions of n into partition numbers.
|
|
CROSSREFS
|
Cf. A000027, A000041, A007279, A130898, A130899, A130900 which are m-fold self-compositions of the "partition transformation" on the counting numbers, m=0, 1, 2, 4, 5.
Sequence in context: A008627 A027593 A007211 this_sequence A115029 A023025 A130898
Adjacent sequences: A130897 A130898 A130899 this_sequence A130901 A130902 A130903
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Graeme McRae (g_m(AT)mcraefamily.com), Jun 07 2007
|
|
|
Search completed in 0.002 seconds
|
