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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275004 a(n) = f_n(2), with f_0(x) = x+4, f_n+1(x) = (f_n)^x(x). 5
 6, 10, 50, 4440892098500626161694526672363281250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Next term is too large to include. This function is a particular instance of the fast-iteration hierarchy function F[k]_n(x). Here we have f_n(x) = F[4]_n(x). See A275000 for details and definitions and formulae. LINKS Table of n, a(n) for n=0..3. MATHEMATICA f[0, x_] := x + 4; f[n_, x_] := Nest[f[n - 1, # ]&, x, x]; Table[f[n, 2], {n, 0, 3}] CROSSREFS A154714(F[1]_n(2)), A275002(F[n]_3(2)), A275003(F[3]_n(x)), A275005(F[5]_n(x)), A275006(F[6]_n(x)), A275009(F[k]_n(2)). Sequence in context: A032359 A346501 A115917 * A115741 A177168 A136843 Adjacent sequences: A275001 A275002 A275003 * A275005 A275006 A275007 KEYWORD nonn AUTHOR Natan Arie Consigli, Nov 09 2016 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.

Last modified May 19 19:45 EDT 2024. Contains 372703 sequences. (Running on oeis4.)