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.

A319368 Triangle read by rows: T(n,k) is the number of simple connected vertex transitive graphs with n nodes and valency k, (0 <= k < n).

Table of values

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

List of values

[1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 3, 2, 1, 1, 0, 0, 1, 0, 3, 0, 2, 0, 1, 0, 0, 1, 3, 3, 4, 3, 2, 1, 1, 0, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 0, 1, 4, 10, 12, 13, 11, 7, 4, 1, 1, 0, 0, 1, 0, 3, 0, 4, 0, 3, 0, 1, 0, 1]