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.

A008327 Triangle read by rows: T(n,k) is the number of simple regular bipartite graphs with 2n nodes and degree k, (0 <= k <= n).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 1
14 1
15 1
16 1
17 2
18 2
19 1
20 1
21 1
22 1
23 4
24 6
25 4
26 1
27 1
28 1
29 1
30 4
31 14
32 14
33 4
34 1
35 1
36 1
37 1
38 7
39 41
40 130
41 41
42 7
43 1
44 1
45 1
46 1
47 8
48 157
49 1981
50 1981
51 157
52 8
53 1
54 1
55 1
56 1
57 12
58 725
59 62616
60 304496
61 62616
62 725
63 12
64 1
65 1
66 1
67 1
68 14
69 4196
70 2806508
71 78322916

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 6, 4, 1, 1, 1, 1, 4, 14, 14, 4, 1, 1, 1, 1, 7, 41, 130, 41, 7, 1, 1, 1, 1, 8, 157, 1981, 1981, 157, 8, 1, 1, 1, 1, 12, 725, 62616, 304496, 62616, 725, 12, 1, 1, 1, 1, 14, 4196, 2806508, 78322916]