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.

A219347 Number of partitions of n into distinct parts with smallest possible largest part.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 1
9 1
10 1
11 2
12 2
13 1
14 1
15 1
16 3
17 2
18 2
19 1
20 1
21 1
22 4
23 3
24 2
25 2
26 1
27 1
28 1
29 5
30 4
31 3
32 2
33 2
34 1
35 1
36 1
37 6
38 5
39 4
40 3
41 2
42 2
43 1
44 1
45 1
46 8
47 6
48 5
49 4
50 3
51 2
52 2
53 1
54 1
55 1
56 10
57 8
58 6
59 5
60 4
61 3
62 2
63 2
64 1
65 1
66 1
67 12
68 10
69 8
70 6
71 5
72 4
73 3
74 2
75 2
76 1
77 1
78 1
79 15
80 12
81 10
82 8
83 6
84 5

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 4, 3, 2, 2, 1, 1, 1, 5, 4, 3, 2, 2, 1, 1, 1, 6, 5, 4, 3, 2, 2, 1, 1, 1, 8, 6, 5, 4, 3, 2, 2, 1, 1, 1, 10, 8, 6, 5, 4, 3, 2, 2, 1, 1, 1, 12, 10, 8, 6, 5, 4, 3, 2, 2, 1, 1, 1, 15, 12, 10, 8, 6, 5]