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.

A321593 Smallest number of vertices supporting a graph with exactly n Hamiltonian paths.

Table of values

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

List of values

[4, 1, 4, 3, 4, 5, 4, 5, 6, 7, 5, 6, 4, 7, 5, 7, 6, 6, 5, 7, 6, 7, 6, 7, 5, 7, 6, 8, 6, 7, 6, 7, 6, 7, 6, 7, 5, 7, 6, 7, 6, 8, 7, 7, 7, 6, 7, 7, 6, 8, 7, 7, 7, 7, 7, 7, 7, 8, 7, 8, 5, 7, 6, 7, 8, 7, 7, 7, 7, 7, 6, 7, 6, 8, 7, 7, 6, 8, 7, 7, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 7]

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

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