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.

A116645 Number of partitions of n having no doubletons. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] of 18 has two doubletons, shown between parentheses).

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 5
6 8
7 10
8 13
9 20
10 26
11 33
12 46
13 58
14 75
15 101
16 125
17 157
18 206
19 253
20 317
21 403
22 494
23 608
24 760
25 926
26 1131
27 1393
28 1685
29 2038
30 2487
31 2985
32 3585
33 4331
34 5168
35 6172
36 7392
37 8771
38 10410
39 12382
40 14622
41 17258
42 20400
43 23975
44 28159
45 33115
46 38739
47 45298
48 53000

List of values

[1, 1, 1, 3, 3, 5, 8, 10, 13, 20, 26, 33, 46, 58, 75, 101, 125, 157, 206, 253, 317, 403, 494, 608, 760, 926, 1131, 1393, 1685, 2038, 2487, 2985, 3585, 4331, 5168, 6172, 7392, 8771, 10410, 12382, 14622, 17258, 20400, 23975, 28159, 33115, 38739, 45298, 53000]