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!)
A339376 Number of partitions of n into an odd number of distinct triangular numbers. 4
0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 0, 2, 0, 1, 1, 0, 1, 1, 1, 0, 3, 0, 1, 1, 2, 0, 1, 2, 1, 3, 0, 2, 1, 2, 1, 1, 2, 2, 3, 1, 1, 3, 2, 0, 4, 3, 2, 3, 2, 2, 2, 3, 2, 4, 2, 3, 2, 3, 4, 4, 4, 1, 5, 4, 2, 3, 5, 3, 6, 4, 2, 6, 4, 3, 5, 6, 5, 5, 5, 5, 5, 4, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
LINKS
FORMULA
G.f.: (1/2) * (Product_{k>=1} (1 + x^(k*(k + 1)/2)) - Product_{k>=1} (1 - x^(k*(k + 1)/2))).
a(n) = (A024940(n) - A292518(n)) / 2.
EXAMPLE
a(28) = 3 because we have [28], [21, 6, 1] and [15, 10, 3].
MATHEMATICA
nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k (k + 1)/2)), {k, 1, nmax}] - Product[(1 - x^(k (k + 1)/2)), {k, 1, nmax}]), {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A285108 A030216 A357352 * A362425 A159459 A304095
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 02 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 August 30 18:36 EDT 2024. Contains 375545 sequences. (Running on oeis4.)