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.

A293807 a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} 1/(1 - x^a(k))^a(k).

Original entry on oeis.org

1, 1, 1, 4, 9, 14, 19, 24, 39, 63, 87, 111, 155, 235, 329, 423, 552, 771, 1091, 1430, 1825, 2400, 3295, 4392, 5597, 7117, 9367, 12476, 16077, 20182, 25677, 33472, 43406, 54578, 68109, 86475, 111316, 140965, 174836, 217520, 275130, 348555, 433578, 533640, 662620, 831747
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 16 2017

Keywords

Comments

a(n) = number of partitions of n into preceding terms starting from a(1), a(2), a(3), ... (for n > 1), with a(1) type of part a(1), a(2) types of part a(2), ...

Examples

			a(3) = 4 because we have [1a, 1a, 1a], [1a, 1a, 1b], [1a, 1b, 1b] and [1b, 1b, 1b].
G.f. = -x - 2*x^2 + 1/((1 - x)*(1 - x)*(1 - x^4)^4*(1 - x^9)^9*(1 - x^14)^14*(1 - x^19)^19*(1 - x^24)^24*(1 - x^39)^39*...) = 1 + x + x^2 + 4*x^3 + 9*x^4 + 14*x^5 + 19*x^6 + 24*x^7 + 39*x^8 + ...
		

Crossrefs

Programs

  • Maple
    b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
          add(b(n-a(i)*j, i-1)*binomial(a(i)+j-1, j), j=0..n/a(i))))
        end:
    a:= n-> `if`(n<2, 1, b(n, n-1)):
    seq(a(n), n=0..60);  # Alois P. Heinz, Oct 16 2017
  • Mathematica
    a[n_] := a[n] = SeriesCoefficient[Product[1/(1 - x^a[k])^a[k], {k, 1, n - 1}], {x, 0, n}]; a[0] = a[1] = 1; Table[a[n], {n, 0, 45}]
  • Python
    from sympy import binomial
    from sympy.core.cache import cacheit
    @cacheit
    def b(n, i): return 1 if n==0 else 0 if i<1 else sum(b(n - a(i)*j, i - 1) * binomial(a(i) + j - 1, j) for j in range(n//a(i) + 1))
    def a(n): return 1 if n<2 else b(n, n - 1)
    print([a(n) for n in range(51)]) # Indranil Ghosh, Dec 13 2017, after Maple code

Formula

G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies A(x) = -x - 2*x^2 + Product_{n>=1} 1/(1 - x^a(n))^a(n).

A296387 a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} (1 + x^a(k))/(1 - x^a(k)).

Original entry on oeis.org

1, 1, 2, 6, 8, 10, 14, 18, 26, 34, 46, 58, 74, 90, 114, 138, 174, 210, 260, 310, 378, 446, 536, 626, 748, 870, 1034, 1198, 1410, 1622, 1892, 2162, 2510, 2858, 3306, 3754, 4316, 4878, 5576, 6274, 7144, 8014, 9096, 10178, 11508, 12838, 14458, 16078, 18048, 20018, 22410, 24802, 27690, 30578, 34040
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 11 2017

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = SeriesCoefficient[Product[(1 + x^a[k])/(1 - x^a[k]), {k, 1, n - 1}], {x, 0, n}]; a[0] = a[1] = 1; Table[a[n], {n, 0, 54}]

Formula

G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies A(x) = -x - 2*x^2 + Product_{n>=1} (1 + x^a(n))/(1 - x^a(n)).

A300411 a(0) = a(1) = 1; a(n) = [x^n] Product_{k=1..n-1} 1/(1 - a(k)*x^a(k)).

Original entry on oeis.org

1, 1, 1, 4, 9, 14, 19, 24, 45, 75, 105, 135, 229, 359, 503, 647, 1047, 1591, 2272, 2972, 4696, 6996, 9844, 12894, 20064, 29538, 41204, 54407, 84457, 123723, 171757, 225939, 348643, 508693, 703815, 923529, 1423892, 2076942, 2870977, 3763380, 5778379, 8414332, 11621307
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 05 2018

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = SeriesCoefficient[Product[1/(1 - a[k] x^a[k]), {k, 1, n - 1}], {x, 0, n}]; a[0] = a[1] = 1; Table[a[n], {n, 0, 42}]

Formula

G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies A(x) = -x - 2*x^2 + Product_{n>=1} 1/(1 - a(n)*x^a(n)).
Showing 1-3 of 3 results.