|
%I #16 Sep 08 2022 08:45:00
%S 1,1,2,2,4,6,10,16,29,52,94,171,316,586,1093,2048,3856,7282,13798,
%T 26215,49933,95326,182362,349526,671089,1290556,2485514,4793491,
%U 9256396,17895698,34636834,67108864,130150525,252645136,490853406
%N a(n) = ceiling(2^(n-1)/n).
%C 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.
%D 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.
%H Vincenzo Librandi, <a href="/A053637/b053637.txt">Table of n, a(n) for n = 1..1000</a>
%t Table[Ceiling[2^(n-1)/n],{n,1,40}] (* _Vincenzo Librandi_, Dec 19 2011 *)
%o (Magma) [Ceiling(2^(n-1)/n): n in [1..40]]; // _Vincenzo Librandi_, Dec 19 2011
%o (PARI) vector(40, n, ceil(2^(n-1)/n) ) \\ _G. C. Greubel_, May 17 2019
%o (Sage) [ceil(2^(n-1)/n) for n in [1..40]] # _G. C. Greubel_, May 17 2019
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Mar 23 2000
|
