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.

A026806 a(n) = number of numbers k such that only one partition of n has least part k.

Table of values

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

List of values

[1, 2, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 4, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 9, 10, 9, 10, 10, 10, 10, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 12, 12, 13, 12, 13, 13, 13, 13, 14, 13, 14, 14, 14, 14, 15, 14, 15, 15, 15, 15]