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.

A115584 Number of partitions of n in which each part k occurs more than k times.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 1
6 2
7 1
8 3
9 2
10 4
11 3
12 6
13 4
14 7
15 7
16 8
17 8
18 12
19 9
20 15
21 14
22 17
23 18
24 24
25 21
26 29
27 29
28 35
29 35
30 46
31 42
32 56
33 54
34 65
35 67
36 81
37 77
38 98
39 95
40 115
41 114
42 139
43 135
44 164
45 165
46 190
47 195
48 230
49 225
50 272
51 271
52 313
53 321
54 370
55 374
56 433
57 441
58 501
59 514
60 589
61 592
62 681
63 698
64 778
65 809
66 907

List of values

[1, 0, 1, 1, 1, 1, 2, 1, 3, 2, 4, 3, 6, 4, 7, 7, 8, 8, 12, 9, 15, 14, 17, 18, 24, 21, 29, 29, 35, 35, 46, 42, 56, 54, 65, 67, 81, 77, 98, 95, 115, 114, 139, 135, 164, 165, 190, 195, 230, 225, 272, 271, 313, 321, 370, 374, 433, 441, 501, 514, 589, 592, 681, 698, 778, 809, 907]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.