|
Search: id:A130898
|
|
|
| A130898 |
|
Number of partitions of n into "number of partitions of n into partition numbers" numbers. |
|
+0
3
|
|
| 1, 2, 3, 5, 6, 10, 12, 18, 22, 30, 37, 50, 59, 78, 93, 118, 140, 176, 206, 255, 297, 362, 421, 507, 585, 699, 803, 949, 1088, 1276, 1455, 1696, 1927, 2230, 2527, 2909, 3284, 3761, 4233, 4825, 5416, 6146, 6879, 7778, 8682, 9778, 10892, 12226, 13582, 15200
(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 is the partition transformation composed with itself three times on the positive integers.
a(6)=10 because there are 10 partitions of 6 whose parts are 1,2,3,4,6 which are terms of sequence A007279, which is the number of partitions of n into partition numbers.
|
|
EXAMPLE
|
a(6)=12 because there are 12 partitions of 6 whose parts are 1,2,3,4,6 which are terms of sequence A007279, which is the number of partitions of n into partition numbers.
|
|
CROSSREFS
|
Cf. A000027, A000041, A007279, A130899, 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: A130900 A115029 A023025 this_sequence A088314 A097071 A105420
Adjacent sequences: A130895 A130896 A130897 this_sequence A130899 A130900 A130901
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Graeme McRae (g_m(AT)mcraefamily.com), Jun 07 2007
|
|
|
Search completed in 0.002 seconds
|
