login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A330774
Number of n-color perfect compositions of n.
2
1, 1, 1, 5, 1, 11, 1, 61, 7, 15, 1, 259, 1, 19, 17, 1901, 1, 383, 1, 511, 21, 27, 1, 14147, 11, 31, 187, 859, 1, 1403, 1, 147661, 29, 39, 25, 39307, 1, 43, 33, 42351, 1, 2303, 1, 1843, 947, 51, 1, 1815811, 15, 1255, 41, 2479, 1, 46697, 33, 97339, 45, 63, 1, 219347, 1
OFFSET
0,4
COMMENTS
An n-color perfect composition of v is a composition into j types of each part j whose sequence of parts contains one composition of every positive integer less than n.
LINKS
A. O. Munagi, Perfect Compositions of Numbers, J. Integer Seq. 23 (2020), art. 20.5.1.
EXAMPLE
a(5)=11 because v=5 has eleven n-color perfect compositions: (1,1,1,1,1), (1,2,2),(2,2,1), (1,2',2'), (2',2',1), (1,1,3), (3,1,1), (1,1,3'), (3',1,1), (1,1,3''), (3'',1,1).
CROSSREFS
KEYWORD
nonn
AUTHOR
Augustine O. Munagi, Dec 30 2019
STATUS
approved