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.

Showing 1-3 of 3 results.

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.

A299032 Number of ordered ways of writing n-th triangular number as a sum of n squares of positive integers.

Original entry on oeis.org

1, 1, 0, 3, 6, 0, 12, 106, 420, 2718, 18240, 120879, 694320, 5430438, 40668264, 300401818, 2369504386, 19928714475, 174151735920, 1543284732218, 14224347438876, 135649243229688, 1331658133954940, 13369350846412794, 138122850643702056, 1462610254141337590
Offset: 0

Views

Author

Ilya Gutkovskiy, Feb 01 2018

Keywords

Examples

			a(4) = 6 because fourth triangular number is 10 and we have [4, 4, 1, 1], [4, 1, 4, 1], [4, 1, 1, 4], [1, 4, 4, 1], [1, 4, 1, 4] and [1, 1, 4, 4].
		

Crossrefs

Programs

  • Maple
    b:= proc(n, t) option remember; local i; if n=0 then
          `if`(t=0, 1, 0) elif t<1 then 0 else 0;
          for i while i^2<=n do %+b(n-i^2, t-1) od; % fi
        end:
    a:= n-> b(n*(n+1)/2, n):
    seq(a(n), n=0..25);  # Alois P. Heinz, Feb 05 2018
  • Mathematica
    Table[SeriesCoefficient[(-1 + EllipticTheta[3, 0, x])^n/2^n, {x, 0, n (n + 1)/2}], {n, 0, 25}]

Formula

a(n) = [x^(n*(n+1)/2)] (Sum_{k>=1} x^(k^2))^n.

A319223 Number of ordered ways of writing n^3 as a sum of n squares.

Original entry on oeis.org

1, 2, 4, 32, 24, 14112, 674368, 39801344, 2454266992, 166591027058, 12820702401872, 1156778646258336, 119773060481140800, 14004241350957965408, 1791476464655904407168, 247572699435320047056384, 36696694077934168215974368, 5825316759916541565549586176, 989291135292653632945527984868
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 13 2018

Keywords

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[EllipticTheta[3, 0, x]^n, {x, 0, n^3}], {n, 0, 18}]
    Join[{1}, Table[SquaresR[n, n^3], {n, 18}]]

Formula

a(n) = [x^(n^3)] theta_3(x)^n, where theta_3() is the Jacobi theta function.
a(n) = [x^(n^3)] (Sum_{k=-infinity..infinity} x^(k^2))^n.
Showing 1-3 of 3 results.