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”).

Number of compositions of n into parts with multiplicity not larger than 10.
3

%I #4 May 29 2014 16:42:32

%S 1,1,2,4,8,16,32,64,128,256,512,1023,2047,4083,8166,16266,32466,64580,

%T 128522,255119,506025,1001545,1979285,3903439,7683348,15091124,

%U 29577303,57838511,112844632,219646810,426513292,826201797,1596503761,3077988342,5917798459

%N Number of compositions of n into parts with multiplicity not larger than 10.

%C Number of compositions of n avoiding the pattern {1}^11.

%H Alois P. Heinz, <a href="/A243088/b243088.txt">Table of n, a(n) for n = 0..1000</a>

%p b:= proc(n, i, p) option remember; `if`(n=0, p!, `if`(i<1, 0,

%p add(b(n-i*j, i-1, p+j)/j!, j=0..min(n/i, 10))))

%p end:

%p a:= n-> b(n$2, 0):

%p seq(a(n), n=0..50);

%Y Column k=10 of A243081.

%K nonn

%O 0,3

%A _Alois P. Heinz_, May 29 2014