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.

A053637 a(n) = ceiling(2^(n-1)/n).

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 10, 16, 29, 52, 94, 171, 316, 586, 1093, 2048, 3856, 7282, 13798, 26215, 49933, 95326, 182362, 349526, 671089, 1290556, 2485514, 4793491, 9256396, 17895698, 34636834, 67108864, 130150525, 252645136, 490853406
Offset: 1

Views

Author

N. J. A. Sloane, Mar 23 2000

Keywords

Comments

a(n) is a lower bound on (and may be equal to) the isometric path number of the hypercube (see Fitzpatrick et al.). - N. J. A. Sloane, Jan 19 2012.

References

  • Fitzpatrick, Shannon L.; Nowakowski, Richard J.; Holton, Derek; and Caines, Ian; Covering hypercubes by isometric paths. Discrete Math. 240 (2001), no. 1-3, 253-260.

Programs