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.

A281083 Expansion of Product_{k>=0} (1 + x^(5*k*(k+1)/2+1)).

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Jan 14 2017

Keywords

Comments

Number of partitions of n into distinct centered pentagonal numbers (A005891).

Examples

			a(82) = 2 because we have [76, 6] and [51, 31].
		

Crossrefs

Programs

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

Formula

G.f.: Product_{k>=0} (1 + x^(5*k*(k+1)/2+1)).

A281081 Expansion of Product_{k>=0} (1 + x^(3*k*(k+1)/2+1)).

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Jan 14 2017

Keywords

Comments

Number of partitions of n into distinct centered triangular numbers (A005448).

Examples

			a(46) = 2 because we have [46] and [31, 10, 4, 1].
		

Crossrefs

Programs

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

Formula

G.f.: Product_{k>=0} (1 + x^(3*k*(k+1)/2+1)).

A281082 Expansion of Product_{k>=0} (1 + x^(2*k*(k+1)+1)).

Original entry on oeis.org

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

Views

Author

Ilya Gutkovskiy, Jan 14 2017

Keywords

Comments

Number of partitions of n into distinct centered square numbers (A001844).

Examples

			a(66) = 2 because we have [61, 5] and [41, 25].
		

Crossrefs

Programs

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

Formula

G.f.: Product_{k>=0} (1 + x^(2*k*(k+1)+1)).

A322802 Number of compositions (ordered partitions) of n into centered hexagonal numbers (A003215).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 17, 22, 28, 36, 45, 56, 70, 88, 111, 140, 178, 226, 286, 361, 455, 573, 721, 909, 1148, 1451, 1834, 2318, 2928, 3695, 4661, 5880, 7420, 9366, 11826, 14935, 18860, 23812, 30059, 37941, 47888, 60445, 76302, 96327
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 26 2018

Keywords

Crossrefs

Programs

  • Maple
    h:= proc(n) option remember; `if`(n<0, 0, (t->
          `if`(3*t*(t+1)+1>n, t-1, t))(1+h(n-1)))
        end:
    a:= proc(n) option remember; `if`(n=0, 1,
          add(a(n-(3*i*(i+1)+1)), i=0..h(n)))
        end:
    seq(a(n), n=0..60);  # Alois P. Heinz, Dec 28 2018
  • Mathematica
    nmax = 53; CoefficientList[Series[1/(1 - Sum[x^(3 k (k + 1) + 1), {k, 0, nmax}]), {x, 0, nmax}], x]

Formula

G.f.: 1/(1 - Sum_{k>=0} x^(3*k*(k+1)+1)).
Showing 1-4 of 4 results.