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.

A130714 Number of partitions of n such that every part divides the largest part and such that the smallest part divides every part.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 10
7 11
8 16
9 19
10 26
11 27
12 41
13 42
14 55
15 64
16 81
17 83
18 114
19 116
20 151
21 168
22 202
23 210
24 277
25 289
26 348
27 382
28 460
29 478
30 604
31 623
32 747
33 812
34 942
35 1006
36 1223
37 1269
38 1479
39 1605
40 1870
41 1959
42 2329
43 2434
44 2818
45 3056
46 3458
47 3653
48 4280
49 4493
50 5130
51 5507
52 6231
53 6580

List of values

[1, 2, 3, 5, 6, 10, 11, 16, 19, 26, 27, 41, 42, 55, 64, 81, 83, 114, 116, 151, 168, 202, 210, 277, 289, 348, 382, 460, 478, 604, 623, 747, 812, 942, 1006, 1223, 1269, 1479, 1605, 1870, 1959, 2329, 2434, 2818, 3056, 3458, 3653, 4280, 4493, 5130, 5507, 6231, 6580]