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!)
A263048 a(0)=0, a(1)=1; for n>1, a(n) = a(n-2)^a(n-1) + a(n-1)^a(n-2). 0
0, 1, 1, 2, 3, 17, 129145076 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Next term has 365895553 digits.
LINKS
MATHEMATICA
RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == a[n-2]^a[n-1]+a[n-1]^a[n-2]}, a, {n, 6}] (* Vincenzo Librandi, Oct 09 2015 *)
nxt[{a_, b_}]:={b, a^b+b^a}; NestList[nxt, {0, 1}, 6][[;; , 1]] (* Harvey P. Dale, May 02 2023 *)
PROG
(PARI) a(n) = if(n<2, n, a(n-2)^a(n-1)+a(n-1)^a(n-2)) \\ Altug Alkan, Oct 15 2015
(Magma) [n le 2 select n-1 else Self(n-2)^Self(n-1)+Self(n-1)^Self(n-2): n in [1..7]]; // Vincenzo Librandi, Oct 09 2015
CROSSREFS
Sequence in context: A042903 A367686 A132534 * A118702 A073524 A130226
KEYWORD
nonn
AUTHOR
Gianmarco Giordano, Oct 08 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 July 30 01:53 EDT 2024. Contains 374734 sequences. (Running on oeis4.)