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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264933 a(0)=0; a(1)=1; a(2)=2; a(n) = a(n-1)^a(n-2)^a(n-3). 0
0, 1, 2, 2, 4, 256, 340282366920938463463374607431768211456 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..6.

EXAMPLE

a(3) = a(2)^a(1)^a(0) = 2;

a(4) = a(3)^a(2)^a(1) = 2^2^1 = 4;

a(5) = a(4)^a(3)^a(2) = 4^2^2 = 256;

a(6) = a(5)^a(4)^a(3) = 256^4^2 = 340282366920938463463374607431768211456.

MATHEMATICA

RecurrenceTable[{a[0]==0, a[1]==1, a[2]==2, a[n]==a[n-1]^a[n-2]^a[n-3]}, a, {n, 6}]

PROG

(Magma) I:=[0, 1, 2]; [n le 2 select I[n] else Self(n-1)^Self(n-2)^Self(n-3): n in [0..6]];

(PARI) a(n) = if(n<3, n, a(n-1)^a(n-2)^a(n-3));

CROSSREFS

Cf. A051285.

Sequence in context: A114695 A134084 A267346 * A012858 A292383 A332896

Adjacent sequences: A264930 A264931 A264932 * A264934 A264935 A264936

KEYWORD

nonn

AUTHOR

Natan Arie Consigli, Dec 17 2015

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 November 27 14:41 EST 2022. Contains 358405 sequences. (Running on oeis4.)