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.

A000701 One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 3
6 5
7 7
8 10
9 14
10 20
11 27
12 37
13 49
14 66
15 86
16 113
17 146
18 190
19 242
20 310
21 392
22 497
23 623
24 782
25 973
26 1212
27 1498
28 1851
29 2274
30 2793
31 3411
32 4163
33 5059
34 6142
35 7427
36 8972
37 10801
38 12989
39 15572
40 18646
41 22267
42 26561
43 31602
44 37556
45 44533
46 52743
47 62338
48 73593

List of values

[0, 0, 1, 1, 2, 3, 5, 7, 10, 14, 20, 27, 37, 49, 66, 86, 113, 146, 190, 242, 310, 392, 497, 623, 782, 973, 1212, 1498, 1851, 2274, 2793, 3411, 4163, 5059, 6142, 7427, 8972, 10801, 12989, 15572, 18646, 22267, 26561, 31602, 37556, 44533, 52743, 62338, 73593]