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.

A185305 Triangular array E(n,k) counting not necessarily connected k-regular simple graphs on n vertices with girth at least 5.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 0, 2, 0, 1, 1, 3, 2, 1, 0, 3, 0, 1, 1, 4, 9, 1, 0, 5, 0, 1, 1, 6, 49, 1, 0, 7, 0, 1, 1, 9, 455, 1, 0, 10, 0, 1, 1, 1, 13, 5784, 2, 1, 0, 15, 0, 8, 1, 1, 18, 90940, 131, 1, 0, 21, 0, 3917, 1, 1, 26, 1620491, 123859]