A324244 - cp's OEIS frontend

A324244 Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	1
7	0
8	2
9	2
10	2
11	0
12	5
13	4
14	7
15	5
16	0
17	25
18	20
19	16
20	23
21	28
22	0
23	185
24	146
25	119
26	57
27	123
28	223
29	0
30	2459
31	1728
32	1523
33	948
34	405
35	903
36	3151
37	0
38	58156
39	36109
40	32119
41	24637
42	13927
43	4713
44	11746
45	79673
46	0
47	2617378
48	1446609
49	1304109
50	1026845
51	723871
52	353620
53	110734
54	279535
55	3853870

[1, 0, 1, 0, 1, 1, 0, 2, 2, 2, 0, 5, 4, 7, 5, 0, 25, 20, 16, 23, 28, 0, 185, 146, 119, 57, 123, 223, 0, 2459, 1728, 1523, 948, 405, 903, 3151, 0, 58156, 36109, 32119, 24637, 13927, 4713, 11746, 79673, 0, 2617378, 1446609, 1304109, 1026845, 723871, 353620, 110734, 279535, 3853870]

cp's OEIS Frontend

A324244 Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.

Table of values

List of values