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!)
A372703 Number of partitions of n into distinct parts such that number of parts is a multiples of 4. 2
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 6, 9, 11, 15, 18, 23, 27, 34, 39, 47, 54, 64, 72, 84, 94, 108, 120, 136, 150, 169, 185, 207, 226, 251, 273, 302, 328, 362, 393, 433, 470, 518, 563, 621, 677, 748, 818, 906, 994, 1104, 1216, 1354, 1497, 1671, 1853, 2073, 2305, 2582, 2877, 3226, 3599 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,13
LINKS
FORMULA
G.f.: Sum_{k>=0} x^(2*k*(4*k+1)) / Product_{j=1..4*k} (1-x^j) = Sum_{k>=0} Product_{j=1..4*k} (x^j/(1-x^j)).
PROG
(PARI) my(N=70, x='x+O('x^N)); Vec(sum(k=0, N, prod(j=1, 4*k, x^j/(1-x^j))))
CROSSREFS
Cf. A363046.
Sequence in context: A242717 A026810 A001400 * A350897 A008773 A008772
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 23 2024
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 July 29 15:58 EDT 2024. Contains 374734 sequences. (Running on oeis4.)