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.

A244395 Number of partitions of n in which the largest summand has frequency 1, the next largest summand has frequency at most 2, the third largest has frequency at most 3, etc.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 5
7 8
8 11
9 15
10 20
11 26
12 34
13 46
14 59
15 78
16 101
17 129
18 163
19 209
20 261
21 329
22 412
23 517
24 641
25 798
26 986
27 1216
28 1493
29 1829
30 2229
31 2721
32 3303
33 4000
34 4841
35 5841
36 7034
37 8458
38 10144
39 12137
40 14512
41 17306
42 20596
43 24483
44 29045
45 34391
46 40680
47 48032
48 56627
49 66666

List of values

[1, 1, 1, 2, 3, 4, 5, 8, 11, 15, 20, 26, 34, 46, 59, 78, 101, 129, 163, 209, 261, 329, 412, 517, 641, 798, 986, 1216, 1493, 1829, 2229, 2721, 3303, 4000, 4841, 5841, 7034, 8458, 10144, 12137, 14512, 17306, 20596, 24483, 29045, 34391, 40680, 48032, 56627, 66666]