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.

A207034 Sum of all parts minus the number of parts of the n-th partition in the list of colexicographically ordered partitions of j, if 1<=n<=A000041(j).

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 3
6 3
7 4
8 3
9 4
10 4
11 5
12 4
13 5
14 5
15 6
16 4
17 5
18 5
19 6
20 6
21 6
22 7
23 5
24 6
25 6
26 7
27 6
28 7
29 7
30 8
31 5
32 6
33 6
34 7
35 7
36 7
37 8
38 7
39 8
40 8
41 8
42 9
43 6
44 7
45 7
46 8
47 7
48 8
49 8
50 9
51 8
52 8
53 9
54 9
55 9
56 10
57 6
58 7
59 7
60 8
61 8
62 8
63 9
64 8
65 9
66 9
67 9
68 10
69 8
70 9
71 9
72 10
73 9
74 10
75 10
76 10
77 11
78 7
79 8
80 8
81 9
82 8
83 9

List of values

[0, 1, 2, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8, 5, 6, 6, 7, 7, 7, 8, 7, 8, 8, 8, 9, 6, 7, 7, 8, 7, 8, 8, 9, 8, 8, 9, 9, 9, 10, 6, 7, 7, 8, 8, 8, 9, 8, 9, 9, 9, 10, 8, 9, 9, 10, 9, 10, 10, 10, 11, 7, 8, 8, 9, 8, 9]