A328863 - cp's OEIS frontend

A328863 Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops.

n	a(n)
1	1
2	2
3	4
4	6
5	9
6	14
7	19
8	27
9	37
10	50
11	66
12	89
13	115
14	151
15	195
16	252
17	321
18	412
19	520
20	660
21	829
22	1042
23	1299
24	1623
25	2010
26	2492
27	3071
28	3783
29	4635
30	5679
31	6922
32	8434
33	10234
34	12406
35	14985
36	18085
37	21751
38	26135
39	31312
40	37471
41	44723
42	53321
43	63415
44	75336
45	89303
46	105734
47	124938

[1, 2, 4, 6, 9, 14, 19, 27, 37, 50, 66, 89, 115, 151, 195, 252, 321, 412, 520, 660, 829, 1042, 1299, 1623, 2010, 2492, 3071, 3783, 4635, 5679, 6922, 8434, 10234, 12406, 14985, 18085, 21751, 26135, 31312, 37471, 44723, 53321, 63415, 75336, 89303, 105734, 124938]

cp's OEIS Frontend

A328863 Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops.

Table of values

List of values