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-4 of 4 results.

A045847 Matrix whose (i,j)-th entry is number of representations of j as a sum of i squares of nonnegative integers; read by diagonals.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 1, 0, 0, 1, 4, 3, 0, 1, 0, 1, 5, 6, 1, 2, 0, 0, 1, 6, 10, 4, 3, 2, 0, 0, 1, 7, 15, 10, 5, 6, 0, 0, 0, 1, 8, 21, 20, 10, 12, 3, 0, 0, 0, 1, 9, 28, 35, 21, 21, 12, 0, 1, 1, 0, 1, 10, 36, 56, 42, 36, 30, 4, 3, 2, 0, 0, 1, 11, 45, 84, 78, 63, 61, 20, 6, 6, 2, 0, 0
Offset: 0

Views

Author

Keywords

Examples

			Rows are
1,0,0,..;
1,1,0,0,1,0..;
1,2,1,0,2,2,..;
1,3,3,1,...
		

Crossrefs

Diagonal gives A287617.
Antidiagonal sums give A302018.

Formula

i-th row is expansion of (1+x+x^4+x^9+...)^i.

Extensions

More terms from Erich Friedman

A340947 Number of ways to write n as an ordered sum of 10 squares of positive integers.

Original entry on oeis.org

1, 0, 0, 10, 0, 0, 45, 0, 10, 120, 0, 90, 210, 0, 360, 262, 45, 840, 300, 360, 1260, 480, 1260, 1350, 1015, 2520, 1560, 2200, 3150, 2880, 4186, 2880, 5430, 6240, 3780, 8300, 7080, 7920, 11160, 7320, 13257, 14640, 10600, 16470, 18570, 18240, 19620, 22230, 25135, 27720, 28020, 28480, 38160
Offset: 10

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Crossrefs

Programs

  • Maple
    b:= proc(n, t) option remember;
          `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add((s->
          `if`(s>n, 0, b(n-s, t-1)))(j^2), j=1..isqrt(n))))
        end:
    a:= n-> b(n, 10):
    seq(a(n), n=10..62);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 62; CoefficientList[Series[(EllipticTheta[3, 0, x] - 1)^10/1024, {x, 0, nmax}], x] // Drop[#, 10] &

Formula

G.f.: (theta_3(x) - 1)^10 / 1024, where theta_3() is the Jacobi theta function.

A341001 Number of partitions of n into 10 distinct nonzero squares.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 1
Offset: 385

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

A341405 Number of nonnegative solutions to (x_1)^2 + (x_2)^2 + ... + (x_10)^2 <= n.

Original entry on oeis.org

1, 11, 56, 176, 396, 738, 1308, 2268, 3618, 5258, 7449, 10689, 14889, 19609, 25369, 33289, 43154, 53774, 65739, 81339, 100671, 121221, 143421, 171501, 205701, 241283, 278678, 324398, 378998, 435968, 495428, 566468, 650798, 737888, 826083, 930123, 1053323
Offset: 0

Views

Author

Ilya Gutkovskiy, Feb 10 2021

Keywords

Comments

Partial sums of A045852.

Crossrefs

Programs

  • Maple
    b:= proc(n, k) option remember; `if`(n=0, 1, `if`(n<0 or k<1, 0,
          b(n, k-1)+add(b(n-j^2, k-1), j=1..isqrt(n))))
        end:
    a:= proc(n) option remember; b(n, 10)+`if`(n>0, a(n-1), 0) end:
    seq(a(n), n=0..36);  # Alois P. Heinz, Feb 10 2021
  • Mathematica
    nmax = 36; CoefficientList[Series[(1 + EllipticTheta[3, 0, x])^10/(1024 (1 - x)), {x, 0, nmax}], x]

Formula

G.f.: (1 + theta_3(x))^10 / (1024 * (1 - x)).
a(n^2) = A055409(n).
Showing 1-4 of 4 results.