cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A143981 The number of unigraphical partitions of 2m; that is, the number of partitions of 2m which are realizable as the degree sequence of one and only one graph (where loops are not allowed but multiple edges are allowed).

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 15
6 19
7 26
8 36
9 46
10 59
11 80
12 100
13 128
14 167
15 211
16 267
17 341
18 429
19 541
20 682
21 850
22 1063
23 1327
24 1647
25 2035
26 2520
27 3100
28 3810
29 4669
30 5708
31 6955
32 8468
33 10267
34 12441
35 15026
36 18120
37 21788
38 26175
39 31355
40 37510
41 44769
42 53362
43 63460
44 75384
45 89348

List of values

[1, 3, 6, 9, 15, 19, 26, 36, 46, 59, 80, 100, 128, 167, 211, 267, 341, 429, 541, 682, 850, 1063, 1327, 1647, 2035, 2520, 3100, 3810, 4669, 5708, 6955, 8468, 10267, 12441, 15026, 18120, 21788, 26175, 31355, 37510, 44769, 53362, 63460, 75384, 89348]