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.

A048164 a(0)=1, a(n+1)=1+(2^(2^n)+1)*a(n).

This page as a plain text file.
%I A048164 #7 Dec 13 2013 13:58:13
%S A048164 1,4,21,358,92007,6029862760,25898063359598159721,
%T A048164 477734946799221833229035410333259818858,
%U A048164 162564778457687820218065957445498785826947155451688293007128627114802460256107
%N A048164 a(0)=1, a(n+1)=1+(2^(2^n)+1)*a(n).
%C A048164 a(n) = height of lattice of orthogonal arrays with 2^2^n runs.
%H A048164 E. M. Rains, N. J. A. Sloane and J. Stufken, The Lattice of N-Run Orthogonal Arrays, J. Stat. Planning Inference, 102 (2002), 477-500 (<a href="http://neilsloane.com/doc/rao.txt">Abstract</a>, <a href="http://neilsloane.com/doc/rao.pdf">pdf</a>, <a href="http://neilsloane.com/doc/rao.ps">ps</a>)
%F A048164 a(n) converges to nearest integer to c*(2^(2^n)-1), where c = 1.403936827882178... (see A048649).
%t A048164 RecurrenceTable[{a[0]==1,a[n]==1+(2^(2^(n-1))+1)a[n-1]},a,{n,10}] (* _Harvey P. Dale_, Dec 13 2013 *)
%Y A048164 Cf. A039930, A048638.
%K A048164 nonn,nice,easy
%O A048164 0,2
%A A048164 _N. J. A. Sloane_, E. M. Rains