A338859 - cp's OEIS frontend

A338859 Square array A(m,k) is the number of unicyclic graphs with m trees of k nodes; m,k >= 0, read by falling antidiagonals.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	1
8	1
9	0
10	1
11	2
12	1
13	1
14	0
15	1
16	4
17	3
18	1
19	1
20	0
21	1
22	9
23	10
24	4
25	1
26	1
27	0
28	1
29	20
30	45
31	20
32	6
33	1
34	1
35	0
36	1
37	48
38	210
39	165
40	55
41	8
42	1
43	1
44	0
45	1
46	115
47	1176
48	1540
49	1035
50	136
51	13
52	1
53	1
54	0
55	1
56	286
57	6670
58	19600
59	22155
60	6273
61	430
62	18
63	1
64	1
65	0
66	1
67	719
68	41041
69	260130
70	692076
71	324008
72	46185
73	1300
74	30
75	1
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 4, 3, 1, 1, 0, 1, 9, 10, 4, 1, 1, 0, 1, 20, 45, 20, 6, 1, 1, 0, 1, 48, 210, 165, 55, 8, 1, 1, 0, 1, 115, 1176, 1540, 1035, 136, 13, 1, 1, 0, 1, 286, 6670, 19600, 22155, 6273, 430, 18, 1, 1, 0, 1, 719, 41041, 260130, 692076, 324008, 46185, 1300, 30, 1, 1, 0]

cp's OEIS Frontend

A338859 Square array A(m,k) is the number of unicyclic graphs with m trees of k nodes; m,k >= 0, read by falling antidiagonals.

Table of values

List of values