This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253648 Numbers of Hamiltonian cycles that require a graph with at least 9 vertices. 1
 89, 91, 107, 117, 119, 121, 125, 127, 137, 141, 143, 151, 154, 155, 157, 159, 161, 163, 167, 170, 171, 173, 175, 178, 179, 181, 182, 185, 187, 189, 190, 191, 193, 195, 196, 197, 199, 201, 202, 203, 205, 206, 207, 209, 211, 213, 215, 217, 218, 221, 224, 225, 226, 227, 229, 233, 234, 235, 236, 237, 238, 239, 241, 242, 243, 244 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Includes all numbers beyond 2520, starting from a(2290) = 2521 on, cf. formula. The first 2521 - 232 = 2289 terms contain the numbers in the interval [0, 2520] with 232 numbers missing, the largest being 2520. LINKS Erich Friedman, Math Magic (September 2012) FORMULA a(n) = n + 231 for n > 2289. CROSSREFS Cf. A244511, A305190. Sequence in context: A104925 A096400 A074119 * A088993 A107202 A260807 Adjacent sequences:  A253645 A253646 A253647 * A253649 A253650 A253651 KEYWORD nonn AUTHOR M. F. Hasler, Jan 18 2015 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 15 14:53 EDT 2019. Contains 327078 sequences. (Running on oeis4.)