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.

A382303 Number of integer partitions of n with exactly as many ones as the next greatest multiplicity.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 1
6 3
7 2
8 4
9 5
10 8
11 6
12 15
13 13
14 19
15 25
16 33
17 36
18 54
19 58
20 80
21 96
22 122
23 141
24 188
25 217
26 274
27 326
28 408
29 474
30 600
31 695
32 859
33 1012
34 1233
35 1440
36 1763
37 2050
38 2475
39 2899
40 3476
41 4045
42 4850
43 5630
44 6695
45 7797
46 9216
47 10689
48 12628
49 14611
50 17162
51 19875
52 23253

List of values

[0, 0, 0, 1, 1, 1, 3, 2, 4, 5, 8, 6, 15, 13, 19, 25, 33, 36, 54, 58, 80, 96, 122, 141, 188, 217, 274, 326, 408, 474, 600, 695, 859, 1012, 1233, 1440, 1763, 2050, 2475, 2899, 3476, 4045, 4850, 5630, 6695, 7797, 9216, 10689, 12628, 14611, 17162, 19875, 23253]