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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 0
7 1
8 1
9 0
10 1
11 1
12 1
13 0
14 1
15 2
16 2
17 1
18 2
19 3
20 2
21 2
22 2
23 4
24 4
25 3
26 4
27 6
28 5
29 5
30 6
31 8
32 8
33 7
34 9
35 11
36 11
37 10
38 12
39 15
40 16
41 15
42 18
43 21
44 21
45 21
46 24
47 28
48 30
49 29
50 33
51 38
52 39
53 40
54 44
55 51
56 53
57 54
58 60
59 67
60 70
61 72
62 79
63 89
64 93
65 96
66 105
67 116
68 121
69 126
70 136
71 150

List of values

[0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 2, 3, 2, 2, 2, 4, 4, 3, 4, 6, 5, 5, 6, 8, 8, 7, 9, 11, 11, 10, 12, 15, 16, 15, 18, 21, 21, 21, 24, 28, 30, 29, 33, 38, 39, 40, 44, 51, 53, 54, 60, 67, 70, 72, 79, 89, 93, 96, 105, 116, 121, 126, 136, 150]