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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274990 a(n) = 2[n](n-2). 1
 -1, 1, 0, 2, 4, 65536 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS x[n]y is the square-bracket notation for hyperoperations. See A054871 for details and key links. LINKS Table of n, a(n) for n=0..5. EXAMPLE a(0) = 2[0]-2 = -1; a(1) = 2[1]-1 = 1; a(2) = 2[2]0 = 0; a(3) = 2[3]1 = 2; a(4) = 2[4]2 = 4; a(6) = 2[5]3 = 65536; a(7) = 2[6]4 = 2[6]2[6]2 = 2[7]3. CROSSREFS Cf. A001695 (2[n]n). Sequence in context: A070655 A006263 A266198 * A079236 A138852 A062701 Adjacent sequences: A274987 A274988 A274989 * A274991 A274992 A274993 KEYWORD sign 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.

Last modified December 9 13:48 EST 2023. Contains 367691 sequences. (Running on oeis4.)