login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A374728 Number of n-color gap-free compositions of n. 3
1, 1, 1, 3, 7, 19, 45, 105, 239, 507, 1079, 2303, 4829, 10425, 23263, 53363, 127995, 318983, 816057, 2133241, 5640135, 14975051, 39772751, 105322879, 277547989, 727276225, 1894282195, 4903985955, 12621154315, 32302574959, 82248961437, 208426306113, 525884062427 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
These are integer compositions whose set of parts covers some interval and contains k colors of each part k.
LINKS
EXAMPLE
a(5) = 7 counts: (1,1,1,1,1), (1,2_a,2_b), (1,2_b,2_a), (2_a,1,2_b), (2_a,2_b,1), (2_b,1,2_a), (2_b,2_a,1).
PROG
(PARI)
colr(x, y)={my(r=y-x+1, v=[x..y], z = vector(r*(r+(1+(x-1)*2))/2), k=1); for(i=1, #v, for(j=1, v[i], z[k]=v[i]; k++)); return(z)}
C_x(s, N)={my(x='x+O('x^N), g=if(#s <1, 1, sum(i=1, #s, C_x(s[^i], N+1) * x^(s[i]) )/(1-sum(i=1, #s, x^(s[i]))))); return(g)}
B_x(N)={my(x='x+O('x^N), h=0); for(u=1, N, my(j=0); while(vecsum(colr(u, u+j)) <= N, h += C_x(colr(u, u+j), N+1); j++)); my(a = Vec(h)); vector(N, i, a[i])}
B_x(20)
CROSSREFS
Sequence in context: A146653 A096447 A274596 * A348008 A185696 A141344
KEYWORD
nonn
AUTHOR
John Tyler Rascoe, Jul 17 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 11:19 EDT 2024. Contains 375325 sequences. (Running on oeis4.)