A350785 - cp's OEIS frontend

A350785 Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes such that k is the maximum number that can be reached when the stepping stone puzzle of A337663 is played on the graph, 1 <= k <= n.

n	a(n)
1	1
2	1
3	0
4	0
5	2
6	0
7	0
8	4
9	2
10	0
11	0
12	4
13	12
14	5
15	0
16	0
17	4
18	34
19	53
20	21
21	0
22	0
23	4
24	69
25	244
26	421
27	115
28	0
29	0
30	4
31	118
32	799
33	3618
34	5603
35	975
36	0
37	0
38	4
39	194
40	2070
41	18996
42	102301
43	127692
44	9823
45	0
46	0
47	4
48	312
49	4885
50	84043
51	1194264
52	6652289
53	3645810
54	134964
55	0

[1, 1, 0, 0, 2, 0, 0, 4, 2, 0, 0, 4, 12, 5, 0, 0, 4, 34, 53, 21, 0, 0, 4, 69, 244, 421, 115, 0, 0, 4, 118, 799, 3618, 5603, 975, 0, 0, 4, 194, 2070, 18996, 102301, 127692, 9823, 0, 0, 4, 312, 4885, 84043, 1194264, 6652289, 3645810, 134964, 0]

cp's OEIS Frontend

A350785 Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes such that k is the maximum number that can be reached when the stepping stone puzzle of A337663 is played on the graph, 1 <= k <= n.

Table of values

List of values