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!)
A086105 Adding, multiplying and exponentiating cycle of the previous two terms similar to A039941. 0
0, 1, 1, 1, 1, 2, 2, 4, 6, 24, 4738381338321616896, 4738381338321616920, 22452257707354557353808363243511480320 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(1)=0, a(2)=1, a(n): if n mod 3 is 0: a(n)=a(n-2) + a(n-1), if n mod 3 is 1: a(n)=a(n-2) * a(n-1), if n mod 3 is 2: a(n)=a(n-2)^a(n-1).
EXAMPLE
a(11) = a(9)^a(10)=6^24 because 11 mod 3 is 2.
MATHEMATICA
nxt[{n_, a_, b_}]:={n+1, b, Which[Mod[n+1, 3]==0, a+b, Mod[n+1, 3]==1, a*b, True, a^b]}; NestList[ nxt, {2, 0, 1}, 12][[;; , 2]] (* Harvey P. Dale, Oct 04 2023 *)
CROSSREFS
Cf. A039941.
Sequence in context: A080611 A171421 A072707 * A084701 A113815 A110946
KEYWORD
easy,nonn
AUTHOR
Anthony Peterson (civ2buf(AT)ricochet.com), Jul 09 2003
EXTENSIONS
The next 2 terms are (6^24)^((6^24)*(6^24+24)) and (6^24)^((6^24) * (6^24 + 24)) + (6^24) * (6^24 + 24).
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 April 19 09:23 EDT 2024. Contains 371782 sequences. (Running on oeis4.)