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.

Showing 1-2 of 2 results.

A039930 Height of lattice of parameters of mixed orthogonal arrays with n runs and strength 2.

Original entry on oeis.org

0, 1, 1, 4, 1, 3, 1, 9, 5, 3, 1, 12, 1, 3, 3, 21, 1, 10, 1, 20, 3, 3, 1, 25, 7, 3, 15, 28, 1, 5, 1, 42, 3, 3, 3
Offset: 1

Views

Author

Keywords

Comments

a(36) is the first unknown term.

References

  • A. S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays, Springer-Verlag, NY, 1999.

Crossrefs

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

Original entry on oeis.org

1, 4, 21, 358, 92007, 6029862760, 25898063359598159721, 477734946799221833229035410333259818858, 162564778457687820218065957445498785826947155451688293007128627114802460256107
Offset: 0

Views

Author

N. J. A. Sloane, E. M. Rains

Keywords

Comments

a(n) = height of lattice of orthogonal arrays with 2^2^n runs.

Crossrefs

Programs

  • 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 *)

Formula

a(n) converges to nearest integer to c*(2^(2^n)-1), where c = 1.403936827882178... (see A048649).
Showing 1-2 of 2 results.