cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A258161 a(n) = a(n-1)^3/a(n-2) with a(0)=1, a(1)=2.

Original entry on oeis.org

1, 2, 8, 256, 2097152, 36028797018963968, 22300745198530623141535718272648361505980416
Offset: 0

Views

Author

Vaclav Kotesovec, May 22 2015

Keywords

Comments

The next term has 114 digits.

Crossrefs

Programs

  • 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}]

Formula

a(n) = 2^(Fibonacci(2*n)).
Showing 1-1 of 1 results.