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!)
 A275005 a(n) = f_n(2), with f_0(x) = x+5, f_n+1(x) = (f_n)^x(x). 6
 7, 12, 72, 7659889842507589786155370254176860349292085605349868961792 (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[5]_n(x). See A275000 for details and definitions and formulae. LINKS Table of n, a(n) for n=0..3. FORMULA . MATHEMATICA f[0, x_] := x + 5; f[n_, x_] := Nest[f[n - 1, # ]&, x, x]; Table[f[n, 2], {n, 0, 3}] CROSSREFS Cf. A154714(F[1]_n(2)), A275002(F[n]_3(2)), A275003(F[3]_n(x)), A275004(F[4]_n(x)), A275005(F[5]_n(x)), A275006(F[6]_n(x)), A275009(F[k]_n(2)). Sequence in context: A119179 A121983 A177169 * A298678 A219777 A157808 Adjacent sequences: A275002 A275003 A275004 * A275006 A275007 A275008 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 June 12 14:38 EDT 2024. Contains 373331 sequences. (Running on oeis4.)