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.

A343345 Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 4
9 6
10 11
11 16
12 29
13 36
14 59
15 79
16 115
17 149
18 216
19 270
20 379
21 473
22 634
23 793
24 1063
25 1292
26 1689
27 2079
28 2667
29 3241
30 4142
31 4982
32 6291
33 7582
34 9434
35 11321
36 14049
37 16709
38 20545
39 24490
40 29860
41 35380
42 43004
43 50741
44 61282
45 72284
46 86680
47 101906
48 121990

List of values

[1, 0, 0, 0, 0, 0, 1, 1, 4, 6, 11, 16, 29, 36, 59, 79, 115, 149, 216, 270, 379, 473, 634, 793, 1063, 1292, 1689, 2079, 2667, 3241, 4142, 4982, 6291, 7582, 9434, 11321, 14049, 16709, 20545, 24490, 29860, 35380, 43004, 50741, 61282, 72284, 86680, 101906, 121990]