login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258161 a(n) = a(n-1)^3/a(n-2) with a(0)=1, a(1)=2. 1
1, 2, 8, 256, 2097152, 36028797018963968, 22300745198530623141535718272648361505980416 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The next term has 114 digits.

LINKS

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

FORMULA

a(n) = 2^(Fibonacci(2*n)).

MATHEMATICA

Clear[a]; RecurrenceTable[{a[n]==a[n-1]^3/a[n-2], a[0]==1, a[1]==2}, a, {n, 0, 8}]

Clear[a]; a[0]=2; a[n_]:=a[n]=Product[a[j]^(n-j), {j, 0, n-1}]; Flatten[{1, Table[a[n], {n, 1, 8}]}]

Table[2^(Fibonacci[2*n]), {n, 0, 8}]

CROSSREFS

Cf. A000045, A000301, A001906, A064098, A208207, A230900, A258169.

Sequence in context: A012341 A299374 A203317 * A012296 A009675 A012301

Adjacent sequences:  A258158 A258159 A258160 * A258162 A258163 A258164

KEYWORD

nonn,easy

AUTHOR

Vaclav Kotesovec, May 22 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 16:07 EDT 2020. Contains 335473 sequences. (Running on oeis4.)