|
Search: id:A130899
|
|
|
| A130899 |
|
Number of partitions of n into "number of partitions of n into 'number of partitions of n into partition numbers' numbers" numbers. |
|
+0
3
|
|
| 1, 2, 3, 4, 6, 9, 11, 15, 19, 25, 31, 41, 49, 61, 75, 91, 109, 134, 156, 188, 221, 262, 305, 361, 416, 485, 560, 648, 740, 858, 972, 1115, 1266, 1441, 1627, 1851, 2078, 2348, 2634, 2965, 3309, 3721, 4138, 4625, 5143, 5728, 6344, 7059, 7792, 8637, 9525, 10529
(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 (A130899) is the partition transformation composed with itself four times on the positive integers.
|
|
EXAMPLE
|
a(6)=9 because there are 9 partitions of 6 whose parts are 1,2,3,5,6 which are terms of sequence A130898, which is the number of partitions of n into numbers of partitions of n into partition numbers.
|
|
CROSSREFS
|
Cf. A000027, A000041, A007279, A130898, A130900 which are m-fold self-compositions of the "partition transformation" on the counting numbers, for m=0, 1, 2, 4, 5.
Sequence in context: A039865 A132134 A027594 this_sequence A007210 A035947 A048249
Adjacent sequences: A130896 A130897 A130898 this_sequence A130900 A130901 A130902
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Graeme McRae (g_m(AT)mcraefamily.com), Jun 07 2007
|
|
|
Search completed in 0.002 seconds
|
