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.

A090858 Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 2
5 2
6 2
7 4
8 6
9 7
10 8
11 13
12 15
13 21
14 25
15 30
16 39
17 50
18 58
19 74
20 89
21 105
22 129
23 156
24 185
25 221
26 264
27 309
28 366
29 433
30 505
31 593
32 696
33 805
34 941
35 1090
36 1258
37 1458
38 1684
39 1933
40 2225
41 2555
42 2922
43 3346
44 3823
45 4349
46 4961
47 5644
48 6402
49 7267
50 8234
51 9309
52 10525
53 11886
54 13393

List of values

[0, 0, 1, 0, 2, 2, 2, 4, 6, 7, 8, 13, 15, 21, 25, 30, 39, 50, 58, 74, 89, 105, 129, 156, 185, 221, 264, 309, 366, 433, 505, 593, 696, 805, 941, 1090, 1258, 1458, 1684, 1933, 2225, 2555, 2922, 3346, 3823, 4349, 4961, 5644, 6402, 7267, 8234, 9309, 10525, 11886, 13393]