The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A320608 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A320608

Number of parts in all partitions of n in which no part occurs more than five times.
(history; published version)

#12 by Alois P. Heinz at Fri Jul 31 16:40:08 EDT 2020

STATUS

proposed

approved

#11 by Robert Price at Fri Jul 31 16:09:53 EDT 2020

STATUS

editing

proposed

#10 by Robert Price at Fri Jul 31 16:09:46 EDT 2020

MATHEMATICA

Table[Length[Flatten[Select[IntegerPartitions[n], Max[Tally[#][[All, 2]]] <= 5 &]]], {n, 43}] (* Robert Price, Jul 31 2020 *)

STATUS

approved

editing

#9 by Vaclav Kotesovec at Thu Oct 18 10:19:18 EDT 2018

STATUS

editing

approved

#8 by Vaclav Kotesovec at Thu Oct 18 09:35:41 EDT 2018

FORMULA

a(n) ~ log(6) * exp(Pi*sqrt(5*n)/3) / (2 * Pi * 5^(1/4) * n^(1/4)). - Vaclav Kotesovec, Oct 18 2018

STATUS

approved

editing

#7 by Alois P. Heinz at Wed Oct 17 16:13:49 EDT 2018

STATUS

editing

approved

#6 by Alois P. Heinz at Wed Oct 17 16:13:07 EDT 2018

CROSSREFS

Cf. A219601.

STATUS

approved

editing

#5 by Alois P. Heinz at Wed Oct 17 12:01:12 EDT 2018

STATUS

editing

approved

#4 by Alois P. Heinz at Wed Oct 17 12:00:55 EDT 2018

LINKS

Alois P. Heinz, <a href="/A320608/b320608.txt">Table of n, a(n) for n = 1..5000</a>

#3 by Alois P. Heinz at Wed Oct 17 11:36:19 EDT 2018

MAPLE

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

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

end:

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

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