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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 3
15 4
16 5
17 6
18 9
19 10
20 13
21 16
22 20
23 24
24 31
25 36
26 45
27 54
28 66
29 78
30 97
31 114
32 138
33 164
34 197
35 232
36 280
37 328
38 392
39 461
40 546
41 639
42 758
43 884
44 1041
45 1215
46 1425
47 1657
48 1941
49 2250
50 2624
51 3041
52 3534
53 4084
54 4740
55 5465
56 6321
57 7280
58 8399

List of values

[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 9, 10, 13, 16, 20, 24, 31, 36, 45, 54, 66, 78, 97, 114, 138, 164, 197, 232, 280, 328, 392, 461, 546, 639, 758, 884, 1041, 1215, 1425, 1657, 1941, 2250, 2624, 3041, 3534, 4084, 4740, 5465, 6321, 7280, 8399]