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.

A329471 a(n) = a(n-1)^2 + 3 for n >=2 , where a(0) = 1, a(1) = 3.

Original entry on oeis.org

1, 3, 12, 147, 21612, 467078547, 218162369067631212, 47594819277201331861096436836588947, 2265266822029455509816214491130485582138030749246532017266850242568812
Offset: 0

Views

Author

Clark Kimberling, Dec 31 2019

Keywords

Comments

(a(n)) is a strong divisibility sequence.

Crossrefs

Cf. A329433.

Programs

  • Mathematica
    f[x_] := x^2 + 3; u[0, x_] := 1;
    u[1, x_] := f[x]; u[n_, x_] := f[u[n - 1, x]]
    Table [u[n, x] /. x -> 0, {n, 0, 10}]

Formula

a(n) = p(n,0), where p(n,x) is polynomial defined in A329433.