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.

A124332 a(n) = ((n mod d(n)) +1)th divisor of n, where d(n) is number of positive divisors of n.

Table of values

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

List of values

[1, 1, 3, 2, 5, 3, 7, 1, 1, 5, 11, 1, 13, 7, 15, 2, 17, 1, 19, 4, 3, 11, 23, 1, 5, 13, 27, 14, 29, 15, 31, 4, 3, 17, 35, 1, 37, 19, 39, 1, 41, 3, 43, 4, 9, 23, 47, 24, 7, 5, 51, 26, 53, 27, 55, 1, 3, 29, 59, 1, 61, 31, 9, 2, 5, 3, 67, 4, 3, 35, 71, 1, 73, 37, 15, 38, 7, 39, 79, 1, 3, 41, 83, 1]