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.

A383711 Number of integer partitions of n with no ones such that it is not possible to choose a family of pairwise disjoint strict integer partitions, one of each part.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 0
6 1
7 1
8 3
9 3
10 4
11 6
12 10
13 11
14 17
15 19
16 30
17 36
18 51
19 61
20 84
21 96
22 133
23 160
24 209
25 253
26 325
27 393
28 488
29 598
30 744

List of values

[0, 0, 0, 0, 1, 0, 1, 1, 3, 3, 4, 6, 10, 11, 17, 19, 30, 36, 51, 61, 84, 96, 133, 160, 209, 253, 325, 393, 488, 598, 744]