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.

A136343 Number of partitions of n such that each summand is greater than or equal to the sum of the next two summands.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 4
6 6
7 7
8 10
9 11
10 14
11 16
12 21
13 23
14 29
15 32
16 40
17 43
18 52
19 57
20 69
21 75
22 88
23 96
24 113
25 122
26 141
27 153
28 177
29 190
30 216
31 233
32 265
33 285
34 320
35 345
36 387
37 415
38 461
39 495
40 551
41 589
42 650
43 695
44 767
45 818
46 896
47 957
48 1048
49 1116
50 1214
51 1293
52 1407
53 1495
54 1620
55 1721
56 1864

List of values

[1, 1, 2, 2, 4, 4, 6, 7, 10, 11, 14, 16, 21, 23, 29, 32, 40, 43, 52, 57, 69, 75, 88, 96, 113, 122, 141, 153, 177, 190, 216, 233, 265, 285, 320, 345, 387, 415, 461, 495, 551, 589, 650, 695, 767, 818, 896, 957, 1048, 1116, 1214, 1293, 1407, 1495, 1620, 1721, 1864]