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.

A271773 a(1) = 0, then a(n) is the maximum of all 0 < m < n for which n == a(m) (mod m).

Table of values

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

List of values

[0, 1, 2, 1, 4, 1, 6, 3, 5, 1, 10, 1, 12, 9, 2, 1, 16, 1, 18, 7, 11, 1, 22, 5, 13, 3, 20, 1, 28, 1, 30, 21, 17, 7, 8, 1, 36, 25, 5, 1, 40, 1, 42, 39, 23, 1, 46, 7, 16, 33, 14, 1, 52, 11, 48, 19, 29, 1, 58, 1, 60, 15, 38, 13, 54, 1, 66, 45, 7, 1, 70, 1, 72, 27]