The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A155934 The sequence k(m) defined in A005991. 3
 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Agrees with the burning number of the n-Moebius ladder from n = 2 to at least n = 31. - Eric W. Weisstein, Apr 16 2019 LINKS E. T. Wang and R. K. Guy, Problem E2429, Amer. Math. Monthly, 81 (1974), 1112-1113. Eric Weisstein's World of Mathematics, Burning Number Eric Weisstein's World of Mathematics, Moebius Ladder FORMULA n^(1/2) - n^(5/16) < a(n) <= floor((1/2) * (3 + sqrt(4*n-3))) [from Wang and Guy]. - Sean A. Irvine, Jun 06 2015 CROSSREFS Cf. A003509, A005991. Sequence in context: A046925 A090529 A297212 * A251719 A130822 A194220 Adjacent sequences:  A155931 A155932 A155933 * A155935 A155936 A155937 KEYWORD nonn,more AUTHOR N. J. A. Sloane, Aug 15 2010 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 September 24 11:04 EDT 2020. Contains 337317 sequences. (Running on oeis4.)