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.

A000700 Expansion of Product_{k>=0} (1 + x^(2k+1)); number of partitions of n into distinct odd parts; number of self-conjugate partitions; number of symmetric Ferrers graphs with n nodes.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 2
11 2
12 3
13 3
14 3
15 4
16 5
17 5
18 5
19 6
20 7
21 8
22 8
23 9
24 11
25 12
26 12
27 14
28 16
29 17
30 18
31 20
32 23
33 25
34 26
35 29
36 33
37 35
38 37
39 41
40 46
41 49
42 52
43 57
44 63
45 68
46 72
47 78
48 87
49 93
50 98
51 107
52 117
53 125
54 133
55 144
56 157
57 168
58 178
59 192
60 209
61 223
62 236
63 255
64 276
65 294
66 312
67 335
68 361
69 385

List of values

[1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 5, 5, 5, 6, 7, 8, 8, 9, 11, 12, 12, 14, 16, 17, 18, 20, 23, 25, 26, 29, 33, 35, 37, 41, 46, 49, 52, 57, 63, 68, 72, 78, 87, 93, 98, 107, 117, 125, 133, 144, 157, 168, 178, 192, 209, 223, 236, 255, 276, 294, 312, 335, 361, 385]