A334275 - cp's OEIS frontend

A334275 Number of unlabeled connected graphs with n vertices such that every vertex has exactly 2 vertices at distance 2.

n	a(n)
0	1
1	0
2	0
3	0
4	0
5	1
6	11
7	9
8	7
9	5
10	6
11	7
12	10
13	11
14	14
15	18
16	22
17	26
18	34
19	40
20	50
21	61
22	74
23	89
24	111
25	131
26	159
27	192
28	231
29	274
30	332
31	392
32	469
33	557
34	661
35	780
36	928
37	1088
38	1285
39	1511
40	1776
41	2076
42	2439
43	2843
44	3324
45	3873
46	4511
47	5238
48	6096
49	7057
50	8183
51	9466

[1, 0, 0, 0, 0, 1, 11, 9, 7, 5, 6, 7, 10, 11, 14, 18, 22, 26, 34, 40, 50, 61, 74, 89, 111, 131, 159, 192, 231, 274, 332, 392, 469, 557, 661, 780, 928, 1088, 1285, 1511, 1776, 2076, 2439, 2843, 3324, 3873, 4511, 5238, 6096, 7057, 8183, 9466]

cp's OEIS Frontend

A334275 Number of unlabeled connected graphs with n vertices such that every vertex has exactly 2 vertices at distance 2.

Table of values

List of values