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.

A026834 a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.

Table of values

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

List of values

[1, 1, 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, 16]

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

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