A285529 - cp's OEIS frontend

A285529 Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.

n	a(n)
1	1
2	2
3	2
4	6
5	12
6	6
7	32
8	96
9	96
10	32
11	320
12	1280
13	1920
14	1280
15	320
16	6144
17	30720
18	61440
19	61440
20	30720
21	6144
22	229376
23	1376256
24	3440640
25	4587520
26	3440640
27	1376256
28	229376
29	16777216
30	117440512
31	352321536
32	587202560
33	587202560
34	352321536
35	117440512
36	16777216

[1, 2, 2, 6, 12, 6, 32, 96, 96, 32, 320, 1280, 1920, 1280, 320, 6144, 30720, 61440, 61440, 30720, 6144, 229376, 1376256, 3440640, 4587520, 3440640, 1376256, 229376, 16777216, 117440512, 352321536, 587202560, 587202560, 352321536, 117440512, 16777216]

cp's OEIS Frontend

A285529 Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.

Table of values

List of values