login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329471 a(n) = a(n-1)^2 + 3 for n >=2 , where a(0) = 1, a(1) = 3. 0
1, 3, 12, 147, 21612, 467078547, 218162369067631212, 47594819277201331861096436836588947, 2265266822029455509816214491130485582138030749246532017266850242568812 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
(a(n)) is a strong divisibility sequence.
LINKS
FORMULA
a(n) = p(n,0), where p(n,x) is polynomial defined in A329433.
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}]
CROSSREFS
Cf. A329433.
Sequence in context: A322227 A254433 A285603 * A098152 A028301 A356719
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 31 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)