The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A142471 a(0) = a(1) = 0; thereafter a(n) = a(n-1)*a(n-2) + 2. 2
0, 0, 2, 2, 6, 14, 86, 1206, 103718, 125083910, 12973452977382, 1622770224612082123622, 21052933202100473722674133293917606, 34164073141115747076263787631563122725393126176374288934 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437, alternative link.
FORMULA
a(n) ~ c^(phi^n), where c = 1.278178162398588325773605473403497130099080978627235683548955136178125... and phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, May 21 2015
MAPLE
a:= proc(n) option remember;
if n<2 then 0
else a(n-1)*a(n-2) + 2
fi; end:
seq(a(n), n=0..15); # G. C. Greubel, Apr 03 2021
MATHEMATICA
a[0] = a[1] = 0; a[n_] := a[n-1] a[n-2] + 2; Table[a[n], {n, 0, 15}] (* T. D. Noe, Nov 14 2011 *)
PROG
(Magma) I:=[0, 0]; [n le 2 select I[n] else Self(n-1)*Self(n-2)+2: n in [1..15]]; // Vincenzo Librandi, Nov 14 2011
(Sage)
def a(n): return 0 if n<2 else a(n-1)*a(n-2) + 2
[a(n) for n in (0..15)] # G. C. Greubel, Apr 03 2021
CROSSREFS
Sequence in context: A014431 A201687 A259810 * A323233 A071208 A231536
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, based on email from Carla J. Garner-Bennett, Nov 13 2008
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 May 21 07:02 EDT 2024. Contains 372729 sequences. (Running on oeis4.)