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.

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

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 1
6 1
7 0
8 1
9 2
10 1
11 0
12 1
13 2
14 2
15 1
16 2
17 4
18 3
19 2
20 3
21 5
22 5
23 3
24 5
25 8
26 6
27 5
28 7
29 10
30 10
31 8
32 11
33 15
34 14
35 12
36 15
37 20
38 20
39 18
40 22
41 28
42 27
43 25
44 30
45 37
46 38
47 35
48 42
49 51
50 50
51 49
52 56
53 67
54 69
55 67
56 77
57 90
58 91
59 90
60 102
61 117
62 121
63 121
64 135
65 155
66 159
67 160
68 177

List of values

[1, 0, 0, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 2, 1, 2, 4, 3, 2, 3, 5, 5, 3, 5, 8, 6, 5, 7, 10, 10, 8, 11, 15, 14, 12, 15, 20, 20, 18, 22, 28, 27, 25, 30, 37, 38, 35, 42, 51, 50, 49, 56, 67, 69, 67, 77, 90, 91, 90, 102, 117, 121, 121, 135, 155, 159, 160, 177]