A279484 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A279484

Expansion of Product_{k>=1} (1-x^(k^3)).

1, -1, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

COMMENTS

The difference between the number of partitions of n into an even number of distinct cubes and the number of partitions of n into an odd number of distinct cubes. - Ilya Gutkovskiy, Jan 15 2018

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..100000

MATHEMATICA

nn = 10; CoefficientList[Series[Product[(1-x^(k^3)), {k, nn}], {x, 0, nn^3}], x]

nmax = 1000; nn = Floor[nmax^(1/3)]+1; poly = ConstantArray[0, nn^3 + 1]; poly[[1]] = 1; poly[[2]] = -1; poly[[3]] = 0; Do[Do[poly[[j + 1]] -= poly[[j - k^3 + 1]], {j, nn^3, k^3, -1}]; , {k, 2, nn}]; Take[poly, nmax+1]

CROSSREFS

Cf. A010815, A276516.

Cf. A000009, A033461, A279329.

Cf. A279486.

Sequence in context: A204220 A281814 A353566 * A279329 A374117 A359430

Adjacent sequences: A279481 A279482 A279483 * A279485 A279486 A279487

KEYWORD

sign

AUTHOR

Vaclav Kotesovec, Dec 13 2016

STATUS

approved