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!)
A184639 Number of partitions of n having no parts with multiplicity 4. 8
1, 1, 2, 3, 4, 7, 10, 14, 19, 27, 37, 50, 67, 88, 115, 153, 196, 253, 324, 412, 524, 661, 828, 1036, 1290, 1603, 1980, 2443, 2997, 3671, 4487, 5460, 6631, 8034, 9703, 11703, 14075, 16890, 20226, 24175, 28838, 34332, 40801, 48394, 57307, 67765, 79974 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A000041(n) - A183561(n).
a(n) = A183568(n,0) - A183568(n,4).
G.f.: Product_{j>0} (1-x^(4*j)+x^(5*j))/(1-x^j).
EXAMPLE
a(4) = 4, because 4 partitions of 4 have no parts with multiplicity 4: [1,1,2], [2,2], [1,3], [4].
MAPLE
b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
add((l->`if`(j=4, [l[1]$2], l))(b(n-i*j, i-1)), j=0..n/i)))
end:
a:= n-> (l-> l[1]-l[2])(b(n, n)):
seq(a(n), n=0..50);
MATHEMATICA
b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i<1, {0, 0}, Sum[Function[l, If[j == 4, {l[[1]], l[[1]]}, l]][b[n - i*j, i - 1]], {j, 0, n/i}]]];
a[n_] := b[n, n][[1]] - b[n, n][[2]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A072958 A353837 A062426 * A035565 A240489 A056513
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jan 18 2011
STATUS
approved

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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)