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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052337 Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ... 2

%I

%S 1,1,1,2,2,3,5,6,8,10,13,17,21,27,34,42,53,65,80,98,119,146,177,213,

%T 258,309,370,443,528,628,746,883,1044,1231,1449,1703,1997,2338,2734,

%U 3190,3718,4325,5025,5830,6754,7816,9032,10422,12016,13832,15907,18274

%N Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...

%H Alois P. Heinz, <a href="/A052337/b052337.txt">Table of n, a(n) for n = 0..10000</a>

%F E.g.f. satisfies A(x) = Product_{i>=1} (1-x^(a(i)*(i+1)))/(1-x^i).

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

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

%p end:

%p a:= n-> `if`(n=0, 0, 1)+b(n, n-1):

%p seq(a(n), n=0..70); # _Alois P. Heinz_, Jun 12 2018

%t b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, Sum[b[n - i j, i - 1], {j, 0, Min[n/i, a[i]]}]]];

%t a[n_] := If[n == 0, 0, 1] + b[n, n - 1];

%t a /@ Range[0, 70] (* _Jean-François Alcover_, Nov 23 2020, after _Alois P. Heinz_ *)

%Y Cf. A289501.

%K nonn,eigen

%O 0,4

%A _Christian G. Bower_, Dec 19 1999

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.

Last modified February 7 22:10 EST 2023. Contains 360132 sequences. (Running on oeis4.)