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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 1
7 4
8 6
9 11
10 16
11 29
12 36
13 59
14 80
15 112
16 150
17 214
18 271
19 374
20 476
21 624
22 800
23 1045
24 1298
25 1669
26 2088
27 2628
28 3258
29 4087
30 5000
31 6219
32 7602
33 9331
34 11368
35 13877
36 16754
37 20368
38 24536
39 29580
40 35468
41 42624
42 50845
43 60827
44 72357
45 86078
46 102100
47 121101

List of values

[1, 0, 0, 0, 0, 1, 1, 4, 6, 11, 16, 29, 36, 59, 80, 112, 150, 214, 271, 374, 476, 624, 800, 1045, 1298, 1669, 2088, 2628, 3258, 4087, 5000, 6219, 7602, 9331, 11368, 13877, 16754, 20368, 24536, 29580, 35468, 42624, 50845, 60827, 72357, 86078, 102100, 121101]