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.

A298938 Number of ordered ways of writing n^3 as a sum of n squares of nonnegative integers.

Original entry on oeis.org

1, 1, 1, 4, 5, 686, 13942, 455988, 13617853, 454222894, 18323165948, 802161109047, 42149084452070, 2481730049781672, 157265294178424356, 10977302934685469078, 812821237985857557677, 64539935903231450294134, 5504599828399250884049308
Offset: 0

Views

Author

Ilya Gutkovskiy, Jan 29 2018

Keywords

Examples

			a(4) = 5 because we have [64, 0, 0, 0], [16, 16, 16, 16], [0, 64, 0, 0], [0, 0, 64, 0] and [0, 0, 0, 64].
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[(1 + EllipticTheta[3, 0, x])^n/2^n, {x, 0, n^3}], {n, 0, 18}]

Formula

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