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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275006 a(n) = f_n(2), with f_0(x) = x+6, f_n+1(x) = (f_n)^x(x). 5
 8, 14, 98, 6468953019249515982689295538200433621714406397809250801867790662783382919273856120002 (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[6]_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 + 6; 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)), A275009(F[k]_n(2)). Sequence in context: A050582 A128451 A177170 * A219778 A180756 A279708 Adjacent sequences: A275003 A275004 A275005 * A275007 A275008 A275009 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 23 23:43 EDT 2024. Contains 373661 sequences. (Running on oeis4.)