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.

A117144 Partitions of n in which each part k occurs at least k times.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 3
7 3
8 4
9 5
10 6
11 6
12 8
13 9
14 10
15 12
16 15
17 16
18 19
19 21
20 25
21 28
22 32
23 34
24 41
25 46
26 51
27 55
28 64
29 70
30 79
31 86
32 97
33 106
34 119
35 129
36 146
37 159
38 175
39 190
40 214
41 232
42 256
43 277
44 306
45 334
46 367
47 394
48 434
49 472
50 515
51 556
52 607
53 654
54 714
55 770
56 836
57 901
58 978
59 1048
60 1140
61 1226
62 1322

List of values

[1, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 8, 9, 10, 12, 15, 16, 19, 21, 25, 28, 32, 34, 41, 46, 51, 55, 64, 70, 79, 86, 97, 106, 119, 129, 146, 159, 175, 190, 214, 232, 256, 277, 306, 334, 367, 394, 434, 472, 515, 556, 607, 654, 714, 770, 836, 901, 978, 1048, 1140, 1226, 1322]