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!)
A238211 The total number of 4's in all partitions of n into an odd number of distinct parts. 2
0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 3, 3, 3, 5, 5, 6, 7, 9, 11, 13, 15, 18, 21, 25, 29, 34, 40, 46, 54, 62, 71, 82, 95, 108, 124, 142, 162, 184, 210, 238, 271, 306, 346, 392, 443, 498, 561, 632, 710, 796, 893, 1000, 1120, 1252, 1397, 1560, 1740, 1937, 2156 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,12
COMMENTS
The g.f. for "number of k's" is (1/2)*(x^k/(1+x^k))*(Product_{n>=1} 1 + x^n) + (1/2)*(x^k/(1-x^k))*(Product_{n>=1} 1 - x^n).
LINKS
FORMULA
a(n) = Sum_{j=1..round(n/8)} A067661(n-(2*j-1)*4) - Sum_{j=1..floor(n/8)} A067659(n-8*j).
G.f.: (1/2)*(x^4/(1+x^4))*(Product{n>=1} 1 + x^n) + (1/2)*(x^4/(1-x^4))*(Product_{n>=1} 1 - x^n).
EXAMPLE
a(12) = 3 because the partitions in question are: 7+4+1, 6+4+2, 5+4+3.
CROSSREFS
Column k=4 of A238450.
Sequence in context: A216391 A014202 A309247 * A338451 A145281 A151687
KEYWORD
nonn
AUTHOR
Mircea Merca, Feb 20 2014
EXTENSIONS
Terms a(51) and beyond from Andrew Howroyd, Apr 29 2020
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:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)