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!)
A184640 Number of partitions of n having no parts with multiplicity 5. 8

%I #11 Apr 30 2018 12:29:45

%S 1,1,2,3,5,6,11,14,21,28,39,51,72,92,124,160,210,266,349,438,562,704,

%T 892,1107,1395,1720,2141,2631,3249,3965,4873,5916,7216,8730,10585,

%U 12742,15387,18443,22151,26466,31646,37659,44873,53212,63149,74666,88295

%N Number of partitions of n having no parts with multiplicity 5.

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

%F a(n) = A000041(n) - A183562(n).

%F a(n) = A183568(n,0) - A183568(n,5).

%F G.f.: Product_{j>0} (1-x^(5*j)+x^(6*j))/(1-x^j).

%e a(5) = 6, because 6 partitions of 5 have no parts with multiplicity 5: [1,1,1,2], [1,2,2], [1,1,3], [2,3], [1,4], [5].

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

%p add((l->`if`(j=5, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))

%p end:

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

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

%t b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[Function[l, If[j == 5, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];

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

%t Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Apr 30 2018, after _Alois P. Heinz_ *)

%Y Cf. A000041, A183562, A183568, A007690, A116645, A118807, A184639, A184641, A184642, A184643, A184644, A184645.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jan 18 2011

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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)