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!)
A339367 Number of partitions of n into an odd number of distinct squares. 5
0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 2, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 2, 0, 1, 1, 2, 0, 0, 2, 1, 0, 0, 0, 2, 2, 0, 2, 1, 1, 0, 2, 1, 1, 1, 0, 2, 1, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,50
LINKS
FORMULA
G.f.: (1/2) * (Product_{k>=1} (1 + x^(k^2)) - Product_{k>=1} (1 - x^(k^2))).
a(n) = (A033461(n) - A276516(n)) / 2.
EXAMPLE
a(49) = 2 because we have [49] and [36, 9, 4].
MATHEMATICA
nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] - Product[(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A179229 A117201 A060953 * A348040 A082858 A363164
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 01 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 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)