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!)
A274991 a(n) = 2[n](n+3). 0
4, 6, 10, 64 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
This is the shifted sequence of the Ackermann-Petèr numbers (A046859).
x[n]y is the square-bracket notation for hyperoperations. See A054871 for details and key links.
LINKS
FORMULA
a(n) = A046859 + 3.
EXAMPLE
a(0) = 2[0]3 = 4;
a(1) = 2[1]4 = 6;
a(2) = 2[2]5 = 10;
a(3) = 2[3]6 = 64;
a(4) = 2[4]7 = 2^2^2^65536.
CROSSREFS
Cf. A046859 (2[n](n+3)-3), A274990 (2[n](n-2)), A001695 (2[n]n).
Sequence in context: A242502 A136838 A234276 * A356755 A109378 A132149
KEYWORD
nonn,bref
AUTHOR
Natan Arie Consigli, Sep 24 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 13:09 EST 2024. Contains 370283 sequences. (Running on oeis4.)