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.

A284373 Number of distinct planar connected n-polyhexes having a minimal number of vertices.

Table of values

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

List of values

[1, 1, 1, 1, 1, 3, 1, 1, 4, 1, 2, 1, 2, 1, 3, 1, 6, 3, 1, 1, 1, 7, 4, 1, 4, 2, 1, 3, 2, 1, 4, 3, 1, 9, 6, 3, 1, 2, 1, 1, 10, 7, 4, 1, 5, 4, 2, 1, 4, 3, 2, 1, 6, 4, 3, 1, 12, 9, 6, 3, 1, 2, 2, 1, 1, 13, 10, 7, 4, 1, 7, 5, 4, 2, 1, 5, 4, 3, 2, 1, 7, 6, 4, 3, 1, 15, 12, 9, 6]