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.

A341450 Number of strict integer partitions of n that are empty or have smallest part not dividing all the others.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 0
7 2
8 1
9 3
10 3
11 6
12 3
13 9
14 9
15 12
16 12
17 20
18 18
19 28
20 27
21 37
22 42
23 55
24 51
25 74
26 80
27 98
28 105
29 136
30 137
31 180
32 189
33 232
34 255
35 308
36 320
37 403
38 434
39 512
40 551
41 668
42 706
43 852
44 915
45 1067
46 1170
47 1370
48 1453
49 1722
50 1860
51 2145
52 2332
53 2701
54 2899
55 3355
56 3626
57 4144

List of values

[1, 0, 0, 0, 0, 1, 0, 2, 1, 3, 3, 6, 3, 9, 9, 12, 12, 20, 18, 28, 27, 37, 42, 55, 51, 74, 80, 98, 105, 136, 137, 180, 189, 232, 255, 308, 320, 403, 434, 512, 551, 668, 706, 852, 915, 1067, 1170, 1370, 1453, 1722, 1860, 2145, 2332, 2701, 2899, 3355, 3626, 4144]