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.

A124331 a(n) is the ((phi(n) mod d(n)) + 1)-th positive divisor of n, where phi(n) is number of positive integers which are <= n and are coprime to n and d(n) is the number of positive divisors of n.

Table of values

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

List of values

[1, 2, 1, 4, 1, 3, 1, 1, 1, 1, 1, 6, 1, 7, 1, 8, 1, 1, 1, 4, 1, 11, 1, 1, 25, 1, 9, 1, 1, 1, 1, 16, 1, 1, 1, 4, 1, 19, 1, 1, 1, 7, 1, 4, 1, 23, 1, 12, 1, 5, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 31, 1, 16, 1, 11, 1, 4, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 4, 81, 1, 1, 1, 1, 43, 1, 1, 1, 1, 1, 4, 1, 47, 1, 24, 1, 1, 1]