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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 6
6 9
7 13
8 17
9 25
10 33
11 46
12 61
13 84
14 108
15 147
16 187
17 248
18 316
19 414
20 519
21 675
22 843
23 1077
24 1339
25 1699
26 2090
27 2633
28 3227
29 4020
30 4909
31 6076
32 7369
33 9075
34 10965
35 13394
36 16129
37 19613
38 23493
39 28434
40 33954
41 40858
42 48643
43 58301
44 69124
45 82547
46 97593
47 116017
48 136804
49 162101
50 190504

List of values

[1, 1, 2, 3, 4, 6, 9, 13, 17, 25, 33, 46, 61, 84, 108, 147, 187, 248, 316, 414, 519, 675, 843, 1077, 1339, 1699, 2090, 2633, 3227, 4020, 4909, 6076, 7369, 9075, 10965, 13394, 16129, 19613, 23493, 28434, 33954, 40858, 48643, 58301, 69124, 82547, 97593, 116017, 136804, 162101, 190504]