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.

A249905 Smallest number of vertices supporting a graph with exactly n Hamiltonian cycles up to direction.

Table of values

n a(n)
0 2
1 1
2 5
3 4
4 5
5 6
6 5
7 6
8 6
9 7
10 6
11 7
12 5
13 8
14 6
15 7
16 6
17 7
18 6
19 7
20 7
21 8
22 7
23 7
24 6
25 8
26 7
27 7
28 7
29 8
30 7
31 8
32 7
33 7
34 7
35 8
36 6
37 8
38 7
39 8
40 7
41 8
42 8
43 8
44 8
45 7
46 8
47 8
48 7
49 8
50 8
51 8
52 7
53 8
54 8
55 8
56 8
57 8
58 8
59 8
60 6
61 8
62 7
63 8
64 8
65 8
66 8
67 8
68 8
69 8
70 7
71 8
72 7
73 8
74 8
75 8
76 7
77 8
78 8
79 8
80 7
81 8
82 8
83 8
84 8
85 8
86 8
87 8
88 8
89 9

List of values

[2, 1, 5, 4, 5, 6, 5, 6, 6, 7, 6, 7, 5, 8, 6, 7, 6, 7, 6, 7, 7, 8, 7, 7, 6, 8, 7, 7, 7, 8, 7, 8, 7, 7, 7, 8, 6, 8, 7, 8, 7, 8, 8, 8, 8, 7, 8, 8, 7, 8, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 6, 8, 7, 8, 8, 8, 8, 8, 8, 8, 7, 8, 7, 8, 8, 8, 7, 8, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.