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.

A115029 Number of partitions of n such that all parts, with the possible exception of the smallest, appear only once.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 6
6 10
7 12
8 17
9 22
10 29
11 36
12 48
13 59
14 73
15 93
16 114
17 139
18 171
19 207
20 250
21 304
22 361
23 432
24 517
25 613
26 722
27 856
28 1005
29 1178
30 1382
31 1612
32 1875
33 2184
34 2528
35 2927
36 3386
37 3900
38 4486
39 5159
40 5916
41 6772
42 7749
43 8843
44 10078
45 11482
46 13048
47 14811
48 16805
49 19026

List of values

[1, 1, 2, 3, 5, 6, 10, 12, 17, 22, 29, 36, 48, 59, 73, 93, 114, 139, 171, 207, 250, 304, 361, 432, 517, 613, 722, 856, 1005, 1178, 1382, 1612, 1875, 2184, 2528, 2927, 3386, 3900, 4486, 5159, 5916, 6772, 7749, 8843, 10078, 11482, 13048, 14811, 16805, 19026]