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.

A309684 Sum of the odd parts appearing among the smallest parts of the partitions of n into 3 parts.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 2
6 2
7 3
8 3
9 7
10 7
11 11
12 11
13 15
14 15
15 24
16 24
17 33
18 33
19 42
20 42
21 58
22 58
23 74
24 74
25 90
26 90
27 115
28 115
29 140
30 140
31 165
32 165
33 201
34 201
35 237
36 237
37 273
38 273
39 322
40 322
41 371
42 371
43 420
44 420
45 484
46 484
47 548
48 548
49 612
50 612
51 693
52 693
53 774
54 774
55 855
56 855
57 955
58 955

List of values

[0, 0, 0, 1, 1, 2, 2, 3, 3, 7, 7, 11, 11, 15, 15, 24, 24, 33, 33, 42, 42, 58, 58, 74, 74, 90, 90, 115, 115, 140, 140, 165, 165, 201, 201, 237, 237, 273, 273, 322, 322, 371, 371, 420, 420, 484, 484, 548, 548, 612, 612, 693, 693, 774, 774, 855, 855, 955, 955]