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.

A271531 a(1) = 1; thereafter a(n) is the LCM of all 0 < m < n for which n == a(m) (mod m).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 12
6 1
7 30
8 3
9 28
10 9
11 24
12 5
13 132
14 3
15 26
16 7
17 420
18 1
19 360
20 3
21 4
22 5
23 1680
24 253
25 84
26 15
27 440
28 117
29 1020
30 7
31 42
32 15
33 28
34 725
35 2376
36 1
37 47880
38 3
39 2960
40 1
41 29640
42 155
43 120
44 21
45 476
46 11781
47 11040
48 1
49 2640
50 3
51 1288
52 5
53 300
54 13
55 144
56 285
57 2860
58 7
59 4200
60 1

List of values

[1, 1, 2, 1, 12, 1, 30, 3, 28, 9, 24, 5, 132, 3, 26, 7, 420, 1, 360, 3, 4, 5, 1680, 253, 84, 15, 440, 117, 1020, 7, 42, 15, 28, 725, 2376, 1, 47880, 3, 2960, 1, 29640, 155, 120, 21, 476, 11781, 11040, 1, 2640, 3, 1288, 5, 300, 13, 144, 285, 2860, 7, 4200, 1]