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.

A340249 Sum of the largest parts t 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 2
6 2
7 5
8 8
9 14
10 18
11 30
12 35
13 56
14 63
15 95
16 109
17 156
18 166
19 235
20 255
21 346
22 369
23 491
24 517
25 676
26 707
27 907
28 952
29 1200
30 1239
31 1548
32 1605
33 1974
34 2037
35 2481
36 2550
37 3078
38 3156
39 3774
40 3874
41 4592
42 4685
43 5522
44 5642
45 6596
46 6726
47 7818
48 7958
49 9200
50 9354
51 10754
52 10939
53 12510

List of values

[0, 0, 0, 1, 2, 2, 5, 8, 14, 18, 30, 35, 56, 63, 95, 109, 156, 166, 235, 255, 346, 369, 491, 517, 676, 707, 907, 952, 1200, 1239, 1548, 1605, 1974, 2037, 2481, 2550, 3078, 3156, 3774, 3874, 4592, 4685, 5522, 5642, 6596, 6726, 7818, 7958, 9200, 9354, 10754, 10939, 12510]