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

A339364 Number of partitions of n into an even number of squares.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 3, 1, 3, 3, 3, 3, 4, 4, 6, 4, 7, 6, 7, 7, 8, 9, 11, 9, 13, 12, 14, 14, 16, 16, 20, 17, 23, 22, 25, 25, 28, 29, 33, 31, 37, 38, 41, 42, 45, 48, 54, 51, 61, 60, 67, 67, 72, 76, 84, 81, 93, 93, 102, 104, 110, 117, 125, 125, 139, 140, 153
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Examples

			a(10) = 3 because we have [9, 1], [4, 4, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1].

Links

Crossrefs

Cf. A000290, A001156, A027187, A292520, A339365, A339366, A339367.

Programs

  • Mathematica
    nmax = 70; CoefficientList[Series[(1/2) (Product[1/(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] + Product[1/(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]

Formula

G.f.: (1/2) * (Product_{k>=1} 1 / (1 - x^(k^2)) + Product_{k>=1} 1 / (1 + x^(k^2))).
a(n) = (A001156(n) + A292520(n)) / 2.

A339367 Number of partitions of n into an odd number of distinct squares.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 2, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 2, 0, 1, 1, 2, 0, 0, 2, 1, 0, 0, 0, 2, 2, 0, 2, 1, 1, 0, 2, 1, 1, 1, 0, 2, 1, 1, 2, 3
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Examples

			a(49) = 2 because we have [49] and [36, 9, 4].

Links

Crossrefs

Cf. A000290, A033461, A067659, A276516, A339364, A339365, A339366.

Programs

  • Mathematica
    nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] - Product[(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]

Formula

G.f.: (1/2) * (Product_{k>=1} (1 + x^(k^2)) - Product_{k>=1} (1 - x^(k^2))).
a(n) = (A033461(n) - A276516(n)) / 2.

A339366 Number of partitions of n into an even number of distinct squares.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 3, 1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 0, 3, 1, 1, 1, 1, 0, 1, 3, 1, 1, 0, 1, 3
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Examples

			a(50) = 2 because we have [49, 1] and [36, 9, 4, 1].

Links

Crossrefs

Cf. A000290, A033461, A067661, A276516, A339364, A339365, A339367.

Programs

  • Mathematica
    nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] + Product[(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]

Formula

G.f.: (1/2) * (Product_{k>=1} (1 + x^(k^2)) + Product_{k>=1} (1 - x^(k^2))).
a(n) = (A033461(n) + A276516(n)) / 2.

A339374 Number of partitions of n into an odd number of triangular numbers.

Original entry on oeis.org

0, 1, 0, 2, 0, 2, 1, 3, 1, 4, 3, 4, 4, 6, 5, 9, 7, 10, 9, 14, 10, 19, 15, 21, 18, 27, 22, 34, 30, 37, 37, 47, 43, 57, 56, 64, 66, 80, 75, 96, 94, 108, 110, 131, 125, 155, 154, 173, 178, 207, 201, 240, 245, 267, 280, 315, 315, 364, 374, 406, 423, 477, 473, 543, 555, 604
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 02 2020

Keywords

Examples

			a(7) = 3 because we have [3, 3, 1], [3, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1, 1].

Links

Crossrefs

Cf. A000217, A007294, A027193, A292519, A339365, A339373, A339375, A339376.

Programs

  • Mathematica
    nmax = 65; CoefficientList[Series[(1/2) (Product[1/(1 - x^(k (k + 1)/2)), {k, 1, nmax}] - Product[1/(1 + x^(k (k + 1)/2)), {k, 1, nmax}]), {x, 0, nmax}], x]

Formula

G.f.: (1/2) * (Product_{k>=1} 1 / (1 - x^(k*(k + 1)/2)) - Product_{k>=1} 1 / (1 + x^(k*(k + 1)/2))).
a(n) = (A007294(n) - A292519(n)) / 2.

A339419 Number of compositions (ordered partitions) of n into an odd number of squares.

Original entry on oeis.org

0, 1, 0, 1, 1, 1, 3, 1, 5, 5, 7, 14, 10, 27, 27, 44, 69, 73, 144, 158, 260, 366, 466, 775, 940, 1490, 2031, 2803, 4264, 5551, 8460, 11525, 16399, 23864, 32435, 47981, 66005, 94701, 135072, 187999, 272678, 379095, 543626, 769490, 1083788, 1553661, 2177681, 3113333
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 03 2020

Keywords

Examples

			a(9) = 5 because we have [9], [4, 4, 1], [4, 1, 4], [1, 4, 4] and [1, 1, 1, 1, 1, 1, 1, 1, 1].

Links

Crossrefs

Cf. A000290, A006456, A166444, A317665, A339365, A339417, A339418.

Programs

  • Maple
    b:= proc(n, t) option remember; local r, f, g;
      if n=0 then t else r, f, g:=$0..2; while f<=n
      do r, f, g:= r+b(n-f, 1-t), f+2*g-1, g+1 od; r fi
    end:
a:= n-> b(n, 0):
seq(a(n), n=0..50);  # Alois P. Heinz, Dec 03 2020
  • Mathematica
    nmax = 47; CoefficientList[Series[1/(3 - EllipticTheta[3, 0, x]) - 1/(1 + EllipticTheta[3, 0, x]), {x, 0, nmax}], x]

Formula

G.f.: 1 / (3 - theta_3(x)) - 1 / (1 + theta_3(x)), where theta_3() is the Jacobi theta function.
a(n) = (A006456(n) - A317665(n)) / 2.
a(n) = -Sum_{k=0..n-1} A006456(k) * A317665(n-k).

A339369 Number of partitions of n into an odd number of cubes.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 4, 2, 4, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 6, 4, 6, 5, 6, 5, 7, 6, 7, 6, 8, 6, 8, 7, 8, 8, 9, 8, 9, 9, 9, 9, 10, 10, 11, 10, 12, 10, 12, 11, 12, 12, 14, 12, 14, 13, 14
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Examples

			a(17) = 2 because we have [8, 8, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1].

Links

Crossrefs

Cf. A000578, A003108, A027193, A292560, A339365, A339368.

Programs

  • Mathematica
    nmax = 85; CoefficientList[Series[(1/2) (Product[1/(1 - x^(k^3)), {k, 1, Floor[nmax^(1/3)] + 1}] - Product[1/(1 + x^(k^3)), {k, 1, Floor[nmax^(1/3)] + 1}]), {x, 0, nmax}], x]

Formula

G.f.: (1/2) * (Product_{k>=1} 1 / (1 - x^(k^3)) - Product_{k>=1} 1 / (1 + x^(k^3))).
a(n) = (A003108(n) - A292560(n)) / 2.
Showing 1-6 of 6 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.