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.

A220483 Total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part: a(n) = n + d(n) + p(n-1) + spt(n) - A000070(n) - sigma(n) - 1.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 3
10 5
11 8
12 11
13 19
14 26
15 34
16 51
17 67
18 91
19 118
20 158
21 200
22 271
23 331
24 433
25 538
26 699
27 849
28 1089
29 1323
30 1674
31 2030
32 2542
33 3066
34 3813
35 4567
36 5640
37 6760
38 8272
39 9871
40 12002
41 14290
42 17287
43 20515
44 24675
45 29214
46 34981
47 41282
48 49216
49 57957
50 68798

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 8, 11, 19, 26, 34, 51, 67, 91, 118, 158, 200, 271, 331, 433, 538, 699, 849, 1089, 1323, 1674, 2030, 2542, 3066, 3813, 4567, 5640, 6760, 8272, 9871, 12002, 14290, 17287, 20515, 24675, 29214, 34981, 41282, 49216, 57957, 68798]