A008326 - cp's OEIS frontend

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

n	a(n)
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	2
10	1
11	1
12	1
13	5
14	4
15	1
16	1
17	1
18	13
19	14
20	4
21	1
22	1
23	1
24	38
25	129
26	41
27	7
28	1
29	1
30	1
31	149
32	1980
33	1981
34	157
35	8
36	1
37	1
38	1
39	703
40	62611
41	304495
42	62616
43	725
44	12
45	1
46	1
47	1
48	4132
49	2806490
50	78322915
51	78322916
52	2806508
53	4196
54	14
55	1
56	1
57	1
58	29579
59	158937213
60	27033154060
61	147252447227
62	27033154065
63	158937367
64	29817
65	21
66	1
67	1

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 5, 4, 1, 1, 1, 13, 14, 4, 1, 1, 1, 38, 129, 41, 7, 1, 1, 1, 149, 1980, 1981, 157, 8, 1, 1, 1, 703, 62611, 304495, 62616, 725, 12, 1, 1, 1, 4132, 2806490, 78322915, 78322916, 2806508, 4196, 14, 1, 1, 1, 29579, 158937213, 27033154060, 147252447227, 27033154065, 158937367, 29817, 21, 1, 1]

cp's OEIS Frontend

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

Table of values

List of values