This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053637 a(n) = ceiling(2^(n-1)/n). 4
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[Ceiling[2^(n-1)/n], {n, 1, 40}] (* Vincenzo Librandi, Dec 19 2011 *) PROG (MAGMA) [Ceiling(2^(n-1)/n): n in [1..40]]; // Vincenzo Librandi, Dec 19 2011 (PARI) vector(40, n, ceil(2^(n-1)/n) ) \\ G. C. Greubel, May 17 2019 (Sage) [ceil(2^(n-1)/n) for n in [1..40]] # G. C. Greubel, May 17 2019 CROSSREFS Sequence in context: A270925 A084202 A300865 * A000016 A060553 A293673 Adjacent sequences:  A053634 A053635 A053636 * A053638 A053639 A053640 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 23 2000 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 June 17 19:10 EDT 2019. Contains 324198 sequences. (Running on oeis4.)