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.

A382526 Number of integer partitions of n with fewer ones than greatest multiplicity.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 3
6 4
7 6
8 9
9 12
10 16
11 24
12 30
13 41
14 56
15 72
16 94
17 124
18 158
19 205
20 262
21 331
22 419
23 531
24 663
25 829
26 1033
27 1281
28 1581
29 1954
30 2393
31 2936
32 3584
33 4366
34 5300
35 6433
36 7764
37 9374
38 11277
39 13548
40 16225
41 19425
42 23166
43 27623
44 32842
45 39004
46 46212
47 54719
48 64610
49 76251

List of values

[0, 0, 1, 1, 2, 3, 4, 6, 9, 12, 16, 24, 30, 41, 56, 72, 94, 124, 158, 205, 262, 331, 419, 531, 663, 829, 1033, 1281, 1581, 1954, 2393, 2936, 3584, 4366, 5300, 6433, 7764, 9374, 11277, 13548, 16225, 19425, 23166, 27623, 32842, 39004, 46212, 54719, 64610, 76251]

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

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