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.

A343378 Number of strict integer partitions of n that are empty or such that (1) the smallest part divides every other part and (2) the greatest part is divisible by every other part.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 2
6 3
7 3
8 3
9 4
10 4
11 3
12 6
13 5
14 4
15 6
16 6
17 4
18 8
19 6
20 7
21 9
22 8
23 5
24 12
25 9
26 8
27 9
28 11
29 6
30 14
31 10
32 10
33 11
34 10
35 10
36 20
37 12
38 12
39 15
40 18
41 10
42 21
43 13
44 15
45 19
46 17
47 11
48 27
49 19
50 20
51 20
52 25
53 13
54 27
55 22
56 26
57 23
58 24
59 15
60 34
61 23
62 21
63 27
64 30
65 19
66 38
67 24
68 26
69 27
70 37

List of values

[1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 3, 6, 5, 4, 6, 6, 4, 8, 6, 7, 9, 8, 5, 12, 9, 8, 9, 11, 6, 14, 10, 10, 11, 10, 10, 20, 12, 12, 15, 18, 10, 21, 13, 15, 19, 17, 11, 27, 19, 20, 20, 25, 13, 27, 22, 26, 23, 24, 15, 34, 23, 21, 27, 30, 19, 38, 24, 26, 27, 37]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.