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.

A340246 Sum of the smallest parts q of the partitions of n into 4 parts q,r,s,t such that 1 <= q <= r <= s <= t and q + r + s > t.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 1
7 2
8 4
9 5
10 7
11 10
12 13
13 17
14 21
15 28
16 35
17 44
18 50
19 64
20 75
21 92
22 104
23 128
24 143
25 172
26 190
27 228
28 252
29 297
30 321
31 378
32 411
33 477
34 513
35 594
36 636
37 729
38 777
39 888
40 946
41 1072
42 1132
43 1280
44 1354
45 1520
46 1600
47 1792
48 1882
49 2096
50 2196
51 2440
52 2555
53 2825
54 2945
55 3250
56 3390
57 3725
58 3875

List of values

[0, 0, 0, 1, 1, 1, 2, 4, 5, 7, 10, 13, 17, 21, 28, 35, 44, 50, 64, 75, 92, 104, 128, 143, 172, 190, 228, 252, 297, 321, 378, 411, 477, 513, 594, 636, 729, 777, 888, 946, 1072, 1132, 1280, 1354, 1520, 1600, 1792, 1882, 2096, 2196, 2440, 2555, 2825, 2945, 3250, 3390, 3725, 3875]