|
| |
|
|
A028378
|
|
Concatenate rows of triangle in A028364 (removing duplicates).
|
|
2
| |
|
|
0, 1, 2, 3, 5, 7, 9, 14, 19, 23, 28, 42, 56, 66, 76, 90, 132, 174, 202, 227, 255, 297, 429, 561, 645, 715, 785, 869, 1001, 1430, 1859, 2123, 2333, 2529, 2739, 3003, 3432, 4862, 6292, 7150, 7810, 8398, 8986, 9646, 10504, 11934, 16796, 21658
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(n+1) is the number of subpartitions of the smallest partition of n into distinct parts (minimizing the size of the largest part). The sequence of partitions is [], [1], [2], [2,1], [3,1], [3,2], [3,2,1], [4,2,1], .... - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 11 2006
|
|
|
CROSSREFS
| Cf. A028364, A028376.
Cf. A115728, A115729.
Sequence in context: A200672 A069999 A035563 * A143587 A096305 A039888
Adjacent sequences: A028375 A028376 A028377 * A028379 A028380 A028381
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Wouter Meeussen (wouter.meeussen(AT)pandora.be)
|
| |
|
|
