A258161 -id:A258161 - cp's OEIS frontend

A258169 a(n) = a(n-1)^4/a(n-2) with a(0)=1, a(1)=2.

1, 2, 16, 32768, 72057594037927936, 822752278660603021077484591278675252491367932816789931674304512

Offset: 0

Graph
List
Refs
Listen
History
Text
Internal format

Vaclav Kotesovec, May 22 2015

nonn
easy

The next term has 235 digits.

In general, the recurrence a(n) = a(n-1)^k / a(n-2) with a(0) = 1, a(1) = m, k > 2, has a solution a(n) = m^(((k+sqrt(k^2-4))^n - (k-sqrt(k^2-4))^n) / (sqrt(k^2-4) * 2^n)).

Cf. A001353, A112969, A208208, A258161.

RecurrenceTable[{a[n]==a[n-1]^4/a[n-2], a[0]==1, a[1]==2},a,{n,0,6}]
nxt[{a_,b_}]:={b,b^4/a}; NestList[nxt,{1,2},5][[All,1]] (* Harvey P. Dale, Sep 04 2022 *)

a(n) = 2^(A001353(n)).

a(n) = 2^(((2+sqrt(3))^n-(2-sqrt(3))^n)/(2*sqrt(3))).

cp's OEIS Frontend

A258169 a(n) = a(n-1)^4/a(n-2) with a(0)=1, a(1)=2.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula