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.

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

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 0
5 0
6 1
7 1
8 2
9 2
10 4
11 4
12 6
13 7
14 11
15 12
16 17
17 20
18 28
19 33
20 44
21 52
22 69
23 82
24 105
25 126
26 161
27 191
28 239
29 286
30 355
31 423
32 520
33 618
34 755
35 896
36 1084
37 1285
38 1549
39 1829
40 2190
41 2583
42 3079
43 3621
44 4297
45 5041
46 5960
47 6977
48 8214
49 9595
50 11264
51 13123
52 15353
53 17854
54 20828

List of values

[0, 0, 1, 0, 0, 0, 1, 1, 2, 2, 4, 4, 6, 7, 11, 12, 17, 20, 28, 33, 44, 52, 69, 82, 105, 126, 161, 191, 239, 286, 355, 423, 520, 618, 755, 896, 1084, 1285, 1549, 1829, 2190, 2583, 3079, 3621, 4297, 5041, 5960, 6977, 8214, 9595, 11264, 13123, 15353, 17854, 20828]