This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048164 a(0)=1, a(n+1)=1+(2^(2^n)+1)*a(n). 3
 1, 4, 21, 358, 92007, 6029862760, 25898063359598159721, 477734946799221833229035410333259818858, 162564778457687820218065957445498785826947155451688293007128627114802460256107 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) = height of lattice of orthogonal arrays with 2^2^n runs. LINKS 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 (Abstract, pdf, ps) FORMULA a(n) converges to nearest integer to c*(2^(2^n)-1), where c = 1.403936827882178... (see A048649). MATHEMATICA RecurrenceTable[{a[0]==1, a[n]==1+(2^(2^(n-1))+1)a[n-1]}, a, {n, 10}] (* Harvey P. Dale, Dec 13 2013 *) CROSSREFS Cf. A039930, A048638. Sequence in context: A126458 A319363 A270586 * A118909 A225157 A158947 Adjacent sequences:  A048161 A048162 A048163 * A048165 A048166 A048167 KEYWORD nonn,nice,easy AUTHOR N. J. A. Sloane, E. M. Rains STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 20 14:50 EDT 2019. Contains 326152 sequences. (Running on oeis4.)