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.

A027358 Number of partitions of n into distinct odd parts, the greatest being congruent to 3 mod 4.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 0
6 0
7 1
8 1
9 0
10 1
11 2
12 2
13 1
14 1
15 3
16 3
17 1
18 2
19 4
20 4
21 3
22 3
23 6
24 6
25 4
26 6
27 9
28 9
29 7
30 8
31 12
32 12
33 10
34 12
35 17
36 18
37 15
38 17
39 23
40 24
41 21
42 25
43 32
44 33
45 31
46 34
47 43
48 45
49 42
50 48
51 58
52 61
53 58
54 64
55 77
56 80
57 78
58 87
59 102
60 107
61 106
62 115
63 134
64 141
65 139
66 153
67 175

List of values

[0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 2, 1, 1, 3, 3, 1, 2, 4, 4, 3, 3, 6, 6, 4, 6, 9, 9, 7, 8, 12, 12, 10, 12, 17, 18, 15, 17, 23, 24, 21, 25, 32, 33, 31, 34, 43, 45, 42, 48, 58, 61, 58, 64, 77, 80, 78, 87, 102, 107, 106, 115, 134, 141, 139, 153, 175]