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.

A079122 Number of ways to partition 2*n into distinct positive integers not greater than n.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 3
6 5
7 8
8 13
9 21
10 31
11 46
12 67
13 95
14 134
15 186
16 253
17 343
18 461
19 611
20 806
21 1055
22 1369
23 1768
24 2270
25 2896
26 3678
27 4649
28 5847
29 7325
30 9141
31 11359
32 14069
33 17367
34 21363
35 26202
36 32042
37 39068
38 47512
39 57632
40 69728
41 84167
42 101365
43 121801
44 146053
45 174777

List of values

[1, 0, 0, 1, 1, 3, 5, 8, 13, 21, 31, 46, 67, 95, 134, 186, 253, 343, 461, 611, 806, 1055, 1369, 1768, 2270, 2896, 3678, 4649, 5847, 7325, 9141, 11359, 14069, 17367, 21363, 26202, 32042, 39068, 47512, 57632, 69728, 84167, 101365, 121801, 146053, 174777]