A329790 - cp's OEIS frontend

A329790 Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1).

n	a(n)
1	0
2	1
3	0
4	0
5	2
6	0
7	0
8	2
9	4
10	0
11	0
12	0
13	12
14	12
15	0
16	0
17	0
18	8
19	68
20	40
21	0
22	0
23	0
24	2
25	106
26	400
27	164
28	0
29	0
30	0
31	0
32	88
33	1184
34	2496
35	752
36	0
37	0
38	0
39	0
40	32
41	1728
42	11932
43	17338
44	4020
45	0
46	0
47	0
48	0
49	8
50	1696
51	29444
52	121084
53	127660
54	23576
55	0
56	0
57	0
58	0
59	0
60	964
61	45472
62	442222
63	1259838
64	1030524
65	155632
66	0
67	0
68	0
69	0
70	0
71	432
72	50292
73	1051048
74	6488844
75	13590300
76	8852398
77	1112032

[0, 1, 0, 0, 2, 0, 0, 2, 4, 0, 0, 0, 12, 12, 0, 0, 0, 8, 68, 40, 0, 0, 0, 2, 106, 400, 164, 0, 0, 0, 0, 88, 1184, 2496, 752, 0, 0, 0, 0, 32, 1728, 11932, 17338, 4020, 0, 0, 0, 0, 8, 1696, 29444, 121084, 127660, 23576, 0, 0, 0, 0, 0, 964, 45472, 442222, 1259838, 1030524, 155632, 0, 0, 0, 0, 0, 432, 50292, 1051048, 6488844, 13590300, 8852398, 1112032]

cp's OEIS Frontend

A329790 Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1).

Table of values

List of values