A324239 - cp's OEIS frontend

A324239 Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).

n	a(n)
1	1
2	0
3	1
4	0
5	2
6	0
7	4
8	2
9	0
10	11
11	10
12	0
13	34
14	76
15	2
16	0
17	156
18	682
19	15
20	0
21	1044
22	9864
23	207
24	2
25	0
26	12346
27	245518
28	3197
29	19
30	0
31	274668
32	11366961
33	74614
34	326
35	2

[1, 0, 1, 0, 2, 0, 4, 2, 0, 11, 10, 0, 34, 76, 2, 0, 156, 682, 15, 0, 1044, 9864, 207, 2, 0, 12346, 245518, 3197, 19, 0, 274668, 11366961, 74614, 326, 2]

cp's OEIS Frontend

A324239 Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).

Table of values

List of values