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.

A114641 a(n) = 2^(a(n-2) + log_{2}(a(n-1))), a(1)=1, a(2)=2.

This page as a plain text file.
%I A114641 #17 Jun 28 2021 13:02:01
%S A114641 1,2,4,16,256,16777216,
%T A114641 1942668892225729070919461906823518906642406839052139521251812409738904285205208498176
%N A114641 a(n) = 2^(a(n-2) + log_{2}(a(n-1))), a(1)=1, a(2)=2.
%C A114641 The subsequent terms are too large to include.
%C A114641 Apparently a(n) = A000643(n+2) - A000643(n+1). - _R. J. Mathar_, Apr 22 2007
%F A114641 a(n) = a(n-1) * 2^a(n-2) for n >= 3. - _Alois P. Heinz_, Jun 28 2021
%t A114641 RecurrenceTable[{a[1]==1,a[2]==2,a[n]==2^(a[n-2]+Log[2,a[n-1]])},a,{n,6}] (* _Harvey P. Dale_, Aug 23 2013 *)
%Y A114641 Cf. A112237, A112866.
%K A114641 nonn
%O A114641 1,2
%A A114641 _Yasutoshi Kohmoto_, Feb 18 2006
%E A114641 Definition adapted to offset by _Georg Fischer_, Jun 18 2021