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.

A306585 Start with n and find the LCM of n and A140635(n), and continue until a number m is reached such that A140635(m) = m.

Table of values

n a(n)
1 1
2 2
3 6
4 4
5 120
6 6
7 840
8 24
9 36
10 120
11 83160
12 12
13 1081080
14 840
15 120
16 16
17 294053760
18 36
19 5587021440
20 60
21 840
22 83160
23 128501493120
24 24
25 900
26 1081080
27 7560
28 2520
29 93163582512000
30 120
31 2888071057872000
32 10080
33 83160
34 294053760
35 840
36 36
37 106858629141264000
38 5587021440
39 1081080
40 120
41 4381203794791824000

List of values

[1, 2, 6, 4, 120, 6, 840, 24, 36, 120, 83160, 12, 1081080, 840, 120, 16, 294053760, 36, 5587021440, 60, 840, 83160, 128501493120, 24, 900, 1081080, 7560, 2520, 93163582512000, 120, 2888071057872000, 10080, 83160, 294053760, 840, 36, 106858629141264000, 5587021440, 1081080, 120, 4381203794791824000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.