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.

A244393 Number of partitions of n the largest part of which, call it m, appears once, m-1 appears at most twice, m-2 appears at most thrice, etc.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 6
7 9
8 13
9 17
10 25
11 33
12 45
13 61
14 82
15 106
16 142
17 183
18 238
19 306
20 395
21 499
22 638
23 804
24 1014
25 1268
26 1586
27 1967
28 2447
29 3018
30 3721
31 4566
32 5598
33 6827
34 8328
35 10108
36 12257
37 14812
38 17884
39 21508
40 25856
41 30980
42 37076
43 44261
44 52776
45 62768
46 74578
47 88407
48 104681
49 123703
50 146018
51 172019
52 202445
53 237830
54 279087
55 326991
56 382706

List of values

[1, 1, 1, 2, 3, 4, 6, 9, 13, 17, 25, 33, 45, 61, 82, 106, 142, 183, 238, 306, 395, 499, 638, 804, 1014, 1268, 1586, 1967, 2447, 3018, 3721, 4566, 5598, 6827, 8328, 10108, 12257, 14812, 17884, 21508, 25856, 30980, 37076, 44261, 52776, 62768, 74578, 88407, 104681, 123703, 146018, 172019, 202445, 237830, 279087, 326991, 382706]