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.

A007690 Number of partitions of n in which no part occurs just once.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 2
5 1
6 4
7 2
8 6
9 5
10 9
11 7
12 16
13 11
14 22
15 20
16 33
17 28
18 51
19 42
20 71
21 66
22 100
23 92
24 147
25 131
26 199
27 193
28 275
29 263
30 385
31 364
32 516
33 511
34 694
35 686
36 946
37 925
38 1246
39 1260
40 1650
41 1663
42 2194
43 2202
44 2857
45 2928
46 3721
47 3813
48 4866
49 4967
50 6257
51 6487
52 8051
53 8342
54 10369

List of values

[1, 0, 1, 1, 2, 1, 4, 2, 6, 5, 9, 7, 16, 11, 22, 20, 33, 28, 51, 42, 71, 66, 100, 92, 147, 131, 199, 193, 275, 263, 385, 364, 516, 511, 694, 686, 946, 925, 1246, 1260, 1650, 1663, 2194, 2202, 2857, 2928, 3721, 3813, 4866, 4967, 6257, 6487, 8051, 8342, 10369]