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.

A306010 Let S(m) = d(k)/d(1) + ... + d(1)/d(k), where d(1)..d(k) are the unitary divisors of m; then a(n) is the number m when the sums S(m) are arranged in increasing order.

Table of values

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

List of values

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