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.

A203903 a(n)=f(a(1),a(2),...,a(n-1)), where f=(n-2)-nd elementary symmetric function and a(1)=1, a(2)=1, a(3)=1.

Original entry on oeis.org

1, 1, 1, 3, 10, 103, 10639, 113191411, 12812295557045431, 164154917441086094769014370809371, 26946836920089791747880319422619013022132207748812110372395151551
Offset: 1

Views

Author

Clark Kimberling, Jan 07 2012

Keywords

Comments

The same recurrence applied to initial values
a(1)=1, a(2)=1, a(3)=2 yields A057438.
The same recurrence applied to initial values
a(1)=1, a(2)=2, a(3)=3 yields A061482.

Crossrefs

Programs

  • Mathematica
    a[1] = 1; a[2] = 1; a[3] = 1;
    t[3] = {a[1], a[2], a[3]};
    a[n_] := SymmetricPolynomial[n - 2, t[n - 1]]
    t[n_] := Append[t[n - 1], {a[n]}]
    Flatten[Table[a[n], {n, 1, 12}]]  (* A203903 *)