cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A298672 Number of ordered ways of writing n^3 as a sum of n positive cubes.

Original entry on oeis.org

1, 1, 0, 0, 0, 0, 20, 0, 1121, 72828, 872640, 9037710, 118590450, 1743739426, 24407782672, 424735169040, 7802802463460, 135385454550288, 2823521345232834, 59332856029292241, 1238888844244575904, 28893281420537822022, 684650546073054870188, 16342742577592266281996
Offset: 0

Views

Author

Ilya Gutkovskiy, Jan 24 2018

Keywords

Examples

			a(6) = 20 because we have [64, 64, 64, 8, 8, 8], [64, 64, 8, 64, 8, 8], [64, 64, 8, 8, 64, 8], [64, 64, 8, 8, 8, 64], [64, 8, 64, 64, 8, 8], [64, 8, 64, 8, 64, 8], [64, 8, 64, 8, 8, 64], [64, 8, 8, 64, 64, 8], [64, 8, 8, 64, 8, 64], [64, 8, 8, 8, 64, 64], [8, 64, 64, 64, 8, 8], [8, 64, 64, 8, 64, 8], [8, 64, 64, 8, 8, 64], [8, 64, 8, 64, 64, 8], [8, 64, 8, 64, 8, 64], [8, 64, 8, 8, 64, 64], [8, 8, 64, 64, 64, 8], [8, 8, 64, 64, 8, 64], [8, 8, 64, 8, 64, 64] and [8, 8, 8, 64, 64, 64].
		

Crossrefs

Programs

  • Mathematica
    Join[{1}, Table[SeriesCoefficient[Sum[x^k^3, {k, 1, n}]^n, {x, 0, n^3}], {n, 1, 23}]]

Formula

a(n) = [x^(n^3)] (Sum_{k>=1} x^(k^3))^n.