Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A320613 Number of parts in all partitions of n in which no part occurs more than ten times. 2

%I #10 Jul 31 2020 16:39:53

%S 1,3,6,12,20,35,54,86,128,192,264,387,531,741,1001,1366,1809,2425,

%T 3170,4172,5398,6997,8948,11482,14547,18451,23193,29157,36355,45347,

%U 56150,69509,85565,105216,128732,157393,191545,232870,282033,341164,411251,495197,594369

%N Number of parts in all partitions of n in which no part occurs more than ten times.

%H Alois P. Heinz, <a href="/A320613/b320613.txt">Table of n, a(n) for n = 1..5000</a>

%F a(n) ~ 3^(1/4) * log(11) * exp(2*Pi*sqrt(5*n/33)) / (2 * Pi * 55^(1/4) * n^(1/4)). - _Vaclav Kotesovec_, Oct 18 2018

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

%p (l-> [0, l[1]*j]+l)(b(n-i*j, min(n-i*j, i-1))), j=0..min(n/i, 10))))

%p end:

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

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

%t Table[Length[Flatten[Select[IntegerPartitions[n], Max[Tally[#][[All, 2]]] <= 10 &]]], {n, 43}] (* _Robert Price_, Jul 31 2020 *)

%Y Column k=10 of A210485.

%K nonn

%O 1,2

%A _Alois P. Heinz_, Oct 17 2018

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 6 07:30 EDT 2024. Contains 374960 sequences. (Running on oeis4.)