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!)
A348163 Number of partitions of n such that 4*(greatest part) = (number of parts). 2
0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 2, 3, 4, 5, 6, 8, 9, 12, 14, 16, 18, 22, 25, 30, 35, 42, 49, 60, 68, 81, 93, 109, 127, 149, 171, 200, 231, 269, 309, 359, 410, 474, 544, 625, 715, 824, 939, 1080, 1232, 1411, 1607, 1839, 2090, 2385, 2708, 3081, 3493, 3972, 4493 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,14
COMMENTS
Also, the number of partitions of n such that (greatest part) = 4*(number of parts).
LINKS
FORMULA
G.f.: Sum_{k>=1} x^(5*k-1) * Product_{j=1..k-1} (1-x^(4*k+j-1)/(1-x^j).
EXAMPLE
a(16) = 3 counts these partitions:
[3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[2, 2, 2, 2, 2, 2, 2, 2].
PROG
(PARI) my(N=66, x='x+O('x^N)); concat([0, 0, 0], Vec(sum(k=1, N, x^(5*k-1)*prod(j=1, k-1, (1-x^(4*k+j-1))/(1-x^j)))))
CROSSREFS
Column 4 of A350879.
Sequence in context: A319611 A337102 A239495 * A298210 A045772 A294977
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jan 25 2022
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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)