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.

A001399 a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 10
9 12
10 14
11 16
12 19
13 21
14 24
15 27
16 30
17 33
18 37
19 40
20 44
21 48
22 52
23 56
24 61
25 65
26 70
27 75
28 80
29 85
30 91
31 96
32 102
33 108
34 114
35 120
36 127
37 133
38 140
39 147
40 154
41 161
42 169
43 176
44 184
45 192
46 200
47 208
48 217
49 225
50 234
51 243
52 252
53 261
54 271
55 280
56 290
57 300
58 310
59 320
60 331
61 341

List of values

[1, 1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 19, 21, 24, 27, 30, 33, 37, 40, 44, 48, 52, 56, 61, 65, 70, 75, 80, 85, 91, 96, 102, 108, 114, 120, 127, 133, 140, 147, 154, 161, 169, 176, 184, 192, 200, 208, 217, 225, 234, 243, 252, 261, 271, 280, 290, 300, 310, 320, 331, 341]