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

A340949 Number of ways to write n as an ordered sum of 4 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 4, 0, 6, 4, 4, 12, 1, 16, 6, 16, 12, 12, 22, 8, 36, 4, 30, 24, 21, 36, 18, 36, 28, 48, 16, 44, 36, 44, 48, 36, 46, 40, 72, 20, 73, 48, 54, 72, 42, 68, 56, 84, 50, 72, 78, 56, 84, 84, 62, 112, 60, 60, 110, 84, 97, 72, 120, 76, 116, 84, 72, 144, 102, 104, 96, 108, 102, 156, 102, 92
Offset: 4

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A008438, A010054, A053603, A053604, A319814, A340950, A340951, A340952, A340953, A340954, A340955.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 4):
seq(a(n), n=4..75);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 75; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^4, {x, 0, nmax}], x] // Drop[#, 4] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^4, where theta_2() is the Jacobi theta function.

A340950 Number of ways to write n as an ordered sum of 5 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 5, 0, 10, 5, 10, 20, 5, 35, 11, 40, 30, 35, 55, 30, 90, 25, 100, 60, 80, 120, 60, 140, 90, 161, 100, 165, 135, 165, 210, 140, 220, 180, 265, 170, 295, 200, 285, 330, 205, 365, 260, 395, 295, 391, 350, 355, 480, 340, 455, 490, 415, 480, 515, 445, 600, 510, 565, 550, 680, 545, 555
Offset: 5

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A008439, A010054, A053603, A053604, A319815, A340949, A340951, A340952, A340953, A340954, A340955.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 5):
seq(a(n), n=5..67);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 67; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^5, {x, 0, nmax}], x] // Drop[#, 5] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^5, where theta_2() is the Jacobi theta function.

A340951 Number of ways to write n as an ordered sum of 6 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 6, 0, 15, 6, 20, 30, 15, 66, 21, 90, 61, 90, 126, 86, 210, 90, 270, 156, 261, 320, 210, 450, 261, 516, 375, 542, 495, 570, 727, 540, 870, 650, 966, 816, 1050, 906, 1155, 1266, 1020, 1560, 1090, 1710, 1416, 1698, 1635, 1746, 2120, 1650, 2376, 1980, 2316, 2490, 2368, 2520, 2835
Offset: 6

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A008440, A010054, A053603, A053604, A319816, A340949, A340950, A340952, A340953, A340954, A340955.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 6):
seq(a(n), n=6..62);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 62; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^6, {x, 0, nmax}], x] // Drop[#, 6] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^6, where theta_2() is the Jacobi theta function.

A340952 Number of ways to write n as an ordered sum of 7 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 7, 0, 21, 7, 35, 42, 35, 112, 42, 182, 112, 210, 260, 217, 462, 252, 651, 399, 728, 777, 672, 1232, 749, 1533, 1127, 1659, 1617, 1792, 2289, 1890, 2926, 2212, 3339, 2990, 3584, 3654, 4046, 4613, 4263, 5754, 4487, 6636, 5733, 6825, 7014, 7203, 8617, 7560, 10087, 8302
Offset: 7

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A010054, A053603, A053604, A226252, A319817, A340949, A340950, A340951, A340953, A340954, A340955.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 7):
seq(a(n), n=7..58);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 58; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^7, {x, 0, nmax}], x] // Drop[#, 7] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^7, where theta_2() is the Jacobi theta function.

A340954 Number of ways to write n as an ordered sum of 9 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 9, 0, 36, 9, 84, 72, 126, 261, 162, 576, 336, 882, 873, 1092, 1845, 1386, 3061, 2160, 4167, 3957, 4860, 6948, 5580, 10287, 7812, 12777, 12276, 14634, 18363, 17136, 25056, 21282, 31266, 28899, 36075, 39654, 41202, 51348, 49383, 63270, 59391, 76059, 73611, 87319, 93582, 96966
Offset: 9

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A010054, A053603, A053604, A226253, A319819, A340949, A340950, A340951, A340952, A340953, A340955.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) elif k<1 then 0 else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 9):
seq(a(n), n=9..56);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 56; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^9, {x, 0, nmax}], x] // Drop[#, 9] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^9, where theta_2() is the Jacobi theta function.

A340955 Number of ways to write n as an ordered sum of 10 nonzero triangular numbers.

Original entry on oeis.org

1, 0, 10, 0, 45, 10, 120, 90, 210, 370, 297, 930, 570, 1620, 1480, 2220, 3375, 2940, 6085, 4590, 8981, 8370, 11430, 15100, 13890, 23832, 19155, 31940, 30195, 38520, 46890, 46440, 66550, 59400, 86355, 81532, 104220, 114390, 122410, 153450, 149490, 193440, 188010, 235350, 238840
Offset: 10

Views

Author

Ilya Gutkovskiy, Jan 31 2021

Keywords

Links

Crossrefs

Cf. A000217, A010054, A053603, A053604, A226254, A319820, A340949, A340950, A340951, A340952, A340953, A340954.

Programs

  • Maple
    b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;
      if n=0 then `if`(k=0, 1, 0) else
      while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi
    end:
a:= n-> b(n, 10):
seq(a(n), n=10..54);  # Alois P. Heinz, Jan 31 2021
  • Mathematica
    nmax = 54; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^10, {x, 0, nmax}], x] // Drop[#, 10] &

Formula

G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^10, where theta_2() is the Jacobi theta function.

A341025 Number of partitions of n into 8 distinct nonzero triangular numbers.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 2, 1, 1, 2, 0, 1, 0, 2, 1, 2, 1, 0, 3, 1, 1, 3, 1, 1, 2, 1, 2, 4, 2, 2, 2, 0, 2, 5, 2, 1, 5, 2, 2, 4, 3, 4, 2, 3, 4, 3, 5, 1, 8, 4, 3, 8, 1, 4, 7, 2, 5, 7, 5, 6, 6, 4, 4, 10, 6
Offset: 120

Views

Author

Ilya Gutkovskiy, Feb 02 2021

Keywords

Crossrefs

Cf. A000217, A007331, A010054, A307597, A307598, A319818, A340953, A341021, A341022, A341023, A341024, A341026, A341027.

A341807 Number of ways to write n as an ordered sum of 8 nonzero tetrahedral numbers.

Original entry on oeis.org

1, 0, 0, 8, 0, 0, 28, 0, 0, 64, 0, 0, 126, 0, 0, 224, 0, 0, 336, 8, 0, 456, 56, 0, 589, 168, 0, 672, 336, 0, 708, 616, 0, 728, 1016, 0, 658, 1400, 28, 560, 1856, 168, 476, 2352, 420, 336, 2632, 728, 238, 2968, 1260, 168, 3192, 1904, 84, 3096, 2464, 112, 3192, 3360, 308, 3024, 4144
Offset: 8

Views

Author

Ilya Gutkovskiy, Feb 20 2021

Keywords

Links

Crossrefs

Cf. A000292, A023533, A023670, A282582, A340953, A341791, A341794, A341795, A341796, A341797, A341806, A341808, A341809.

Programs

  • Magma
    R:=PowerSeriesRing(Integers(), 80);
Coefficients(R!( (&+[x^Binomial(j+2,3): j in [1..70]])^8 )); // G. C. Greubel, Jul 19 2022
  • Mathematica
    nmax = 70; CoefficientList[Series[Sum[x^Binomial[k + 2, 3], {k, 1, nmax}]^8, {x, 0, nmax}], x] // Drop[#, 8] &
  • SageMath
    def f(m, x): return ( sum( x^(binomial(j+2,3)) for j in (1..8) ) )^m
def A341807_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( f(8, x) ).list()
a=A341807_list(100); a[8:81] # G. C. Greubel, Jul 19 2022

Formula

G.f.: ( Sum_{k>=1} x^binomial(k+2,3) )^8.
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.