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.

A116665 Total number of parts that appear exactly once in the partitions of n into odd parts.

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 2
5 2
6 3
7 4
8 6
9 7
10 10
11 12
12 16
13 20
14 25
15 31
16 39
17 47
18 58
19 71
20 85
21 103
22 124
23 148
24 176
25 210
26 248
27 293
28 345
29 405
30 474
31 555
32 645
33 751
34 872
35 1009
36 1166
37 1346
38 1549
39 1781
40 2044
41 2341
42 2678
43 3060
44 3488
45 3973
46 4520
47 5132
48 5822
49 6597
50 7464
51 8436
52 9525
53 10740

List of values

[0, 1, 0, 1, 2, 2, 3, 4, 6, 7, 10, 12, 16, 20, 25, 31, 39, 47, 58, 71, 85, 103, 124, 148, 176, 210, 248, 293, 345, 405, 474, 555, 645, 751, 872, 1009, 1166, 1346, 1549, 1781, 2044, 2341, 2678, 3060, 3488, 3973, 4520, 5132, 5822, 6597, 7464, 8436, 9525, 10740]