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.

A010747 Shifts 6 places left under inverse binomial transform.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 1, 1, 1, 1, 1, 1, -62, 315, -1002, 2505, -5377, 10373, -18544, 32086, -60468, 154687, -567986, 2422043, -10225382, 40740231, -152497274, 539809668, -1822828757, 5928049329, -18782176673, 58918636670, -187382010256, 623524250516
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    a:= proc(n) option remember; (m-> `if`(m<0, 2^n,
          add(a(m-j)*binomial(m, j)*(-1)^j, j=0..m)))(n-6)
        end:
    seq(a(n), n=0..35);  # Alois P. Heinz, Feb 02 2022
  • Mathematica
    a[n_] := a[n] = Function[m, If[m < 0, 2^n, Sum[a[m - j]* Binomial[m, j]*(-1)^j, {j, 0, m}]]][n - 6];
    Table[a[n], {n, 0, 35}] (* Jean-François Alcover, Mar 08 2023, after Alois P. Heinz *)

Formula

G.f. A(x) satisfies: A(x) = 1 + 2*x + 4*x^2 + 8*x^3 + 16*x^4 + 32*x^5 + x^6*A(x/(1 + x))/(1 + x). - Ilya Gutkovskiy, Feb 02 2022
a(n) = 2^n for n<6; otherwise a(n) = Sum_{j=0..n-6} a(n-6-j)*binomial(n-6,j)*(-1)^j. - Michel Marcus, Mar 08 2023