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.

A286097 Number of partitions of n such that each part is no more than 4 more than the sum of all smaller parts.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 10
7 13
8 20
9 26
10 37
11 48
12 68
13 86
14 119
15 152
16 204
17 258
18 342
19 428
20 560
21 698
22 897
23 1114
24 1421
25 1748
26 2210
27 2712
28 3390
29 4140
30 5140
31 6240
32 7702
33 9314
34 11402
35 13741
36 16742
37 20071
38 24333
39 29087
40 35056
41 41770
42 50137
43 59503
44 71148
45 84195
46 100213
47 118275
48 140307
49 165041
50 195139

List of values

[1, 1, 2, 3, 5, 6, 10, 13, 20, 26, 37, 48, 68, 86, 119, 152, 204, 258, 342, 428, 560, 698, 897, 1114, 1421, 1748, 2210, 2712, 3390, 4140, 5140, 6240, 7702, 9314, 11402, 13741, 16742, 20071, 24333, 29087, 35056, 41770, 50137, 59503, 71148, 84195, 100213, 118275, 140307, 165041, 195139]