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.

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

This page as a plain text file.
%I A258161 #11 May 22 2015 11:37:04
%S A258161 1,2,8,256,2097152,36028797018963968,
%T A258161 22300745198530623141535718272648361505980416
%N A258161 a(n) = a(n-1)^3/a(n-2) with a(0)=1, a(1)=2.
%C A258161 The next term has 114 digits.
%F A258161 a(n) = 2^(Fibonacci(2*n)).
%t A258161 Clear[a]; RecurrenceTable[{a[n]==a[n-1]^3/a[n-2], a[0]==1, a[1]==2},a,{n,0,8}]
%t A258161 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}]}]
%t A258161 Table[2^(Fibonacci[2*n]), {n, 0, 8}]
%Y A258161 Cf. A000045, A000301, A001906, A064098, A208207, A230900, A258169.
%K A258161 nonn,easy
%O A258161 0,2
%A A258161 _Vaclav Kotesovec_, May 22 2015