login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A222710 Total number of parts of multiplicity 10 in all partitions of n. 2

%I

%S 1,0,1,1,2,2,4,4,7,8,13,15,22,26,37,45,61,74,99,120,158,192,247,300,

%T 382,463,582,705,877,1059,1309,1575,1931,2319,2823,3381,4094,4886,

%U 5886,7007,8401,9971,11905,14090,16756,19781,23436,27594,32586,38268,45050

%N Total number of parts of multiplicity 10 in all partitions of n.

%H Alois P. Heinz, <a href="/A222710/b222710.txt">Table of n, a(n) for n = 10..1000</a>

%F G.f.: (x^10/(1-x^10)-x^11/(1-x^11))/Product_{j>0}(1-x^j).

%F a(n) ~ exp(Pi*sqrt(2*n/3)) / (220*Pi*sqrt(2*n)). - _Vaclav Kotesovec_, May 24 2018

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

%p add((l->`if`(m=10, l+[0, l[1]], l))(b(n-p*m, p-1)), m=0..n/p)))

%p end:

%p a:= n-> b(n, n)[2]:

%p seq(a(n), n=10..60);

%t b[n_, p_] := b[n, p] = If[n == 0, {1, 0}, If[p < 1, {0, 0}, Sum[Function[l, If[m == 10, l + {0, l[[1]]}, l]][b[n - p*m, p - 1]], {m, 0, n/p}]]];

%t a[n_] := b[n, n][[2]];

%t Table[a[n], {n, 10, 60}] (* _Jean-Fran├žois Alcover_, Apr 30 2018, after _Alois P. Heinz_ *)

%Y Column k=10 of A197126.

%K nonn

%O 10,5

%A _Alois P. Heinz_, Feb 28 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 12:52 EST 2020. Contains 331049 sequences. (Running on oeis4.)