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.

A367395 Number of strict integer partitions of n whose length is the sum of two distinct parts.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 1
9 1
10 2
11 2
12 2
13 3
14 3
15 5
16 5
17 7
18 8
19 11
20 13
21 17
22 19
23 25
24 28
25 35
26 41
27 49
28 57
29 68
30 78
31 92
32 107
33 124
34 143
35 166
36 192
37 220
38 254
39 291
40 335
41 382
42 439
43 499
44 572
45 649
46 741
47 840
48 956
49 1080
50 1226
51 1383
52 1566
53 1762
54 1988
55 2235
56 2515
57 2822
58 3166
59 3547

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 5, 5, 7, 8, 11, 13, 17, 19, 25, 28, 35, 41, 49, 57, 68, 78, 92, 107, 124, 143, 166, 192, 220, 254, 291, 335, 382, 439, 499, 572, 649, 741, 840, 956, 1080, 1226, 1383, 1566, 1762, 1988, 2235, 2515, 2822, 3166, 3547]