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.

A027189 Number of partitions of n into an odd number of parts, the least being 3; also, a(n+3) = number of partitions of n into an even number of parts, each >=3.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 0
7 0
8 0
9 1
10 1
11 2
12 2
13 3
14 3
15 5
16 5
17 7
18 8
19 11
20 12
21 17
22 19
23 25
24 29
25 37
26 43
27 56
28 64
29 80
30 94
31 116
32 135
33 167
34 194
35 236
36 276
37 332
38 387
39 466
40 541
41 645
42 752
43 891
44 1034
45 1223
46 1417
47 1666
48 1931
49 2260
50 2613
51 3054
52 3522
53 4098
54 4725
55 5480

List of values

[0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 11, 12, 17, 19, 25, 29, 37, 43, 56, 64, 80, 94, 116, 135, 167, 194, 236, 276, 332, 387, 466, 541, 645, 752, 891, 1034, 1223, 1417, 1666, 1931, 2260, 2613, 3054, 3522, 4098, 4725, 5480]