A361456 - cp's OEIS frontend

A361456 Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).

n	a(n)
0	1
1	1
2	3
3	2
4	13
5	30
6	24
7	6
8	75
9	372
10	780
11	872
12	546
13	180
14	24
15	541
16	4660
17	18180
18	42140
19	64150
20	66900
21	48320
22	23820
23	7650
24	1440
25	120
26	4683
27	62130
28	385980
29	1487520
30	3973770
31	7789032
32	11565360
33	13238520
34	11771130
35	8124710
36	4314420
37	1729440
38	506010
39	101880
40	12600
41	720

[1, 1, 3, 2, 13, 30, 24, 6, 75, 372, 780, 872, 546, 180, 24, 541, 4660, 18180, 42140, 64150, 66900, 48320, 23820, 7650, 1440, 120, 4683, 62130, 385980, 1487520, 3973770, 7789032, 11565360, 13238520, 11771130, 8124710, 4314420, 1729440, 506010, 101880, 12600, 720]

cp's OEIS Frontend

A361456 Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).

Table of values

List of values