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.

A124219 a(n)= m-th positive divisor of n, where phi(n) is number of positive integers which are <= n and are coprime to n, d(n) is the number of positive divisors of n and m = d(n) if d(n)|phi(n), else m = phi(n) mod d(n).

Table of values

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

List of values

[1, 1, 3, 2, 5, 2, 7, 8, 9, 10, 11, 4, 13, 2, 15, 4, 17, 18, 19, 2, 21, 2, 23, 24, 5, 26, 3, 28, 29, 30, 31, 8, 33, 34, 35, 3, 37, 2, 39, 40, 41, 6, 43, 2, 45, 2, 47, 8, 49, 2, 51, 52, 53, 2, 55, 56, 57, 58, 59, 4, 61, 2, 63, 8, 65, 6, 67, 2, 69, 70, 71, 72, 73, 74, 15, 76, 77, 78, 79, 2]