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.

A325343 Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).

Table of values

n a(n)
1 1
2 0
3 1
4 2
5 3
6 4
7 7
8 9
9 14
10 19
11 27
12 36
13 50
14 65
15 87
16 114
17 149
18 192
19 249
20 316
21 404
22 510
23 643
24 805
25 1008
26 1251
27 1553
28 1917
29 2361
30 2895
31 3546
32 4322
33 5262
34 6383
35 7728
36 9330
37 11245
38 13512
39 16213
40 19405
41 23186
42 27643
43 32907
44 39089
45 46366
46 54894
47 64893
48 76584
49 90256

List of values

[1, 0, 1, 2, 3, 4, 7, 9, 14, 19, 27, 36, 50, 65, 87, 114, 149, 192, 249, 316, 404, 510, 643, 805, 1008, 1251, 1553, 1917, 2361, 2895, 3546, 4322, 5262, 6383, 7728, 9330, 11245, 13512, 16213, 19405, 23186, 27643, 32907, 39089, 46366, 54894, 64893, 76584, 90256]