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.

A336164 a(1) = 1; if n>1, and gcd(a(n-1), n) > 1 then a(n) = a(n-1)/gcd(a(n-1), n), otherwise a(n) = a(n-1) + n - 1.

Table of values

n a(n)
1 1
2 2
3 4
4 1
5 5
6 10
7 16
8 2
9 10
10 1
11 11
12 22
13 34
14 17
15 31
16 46
17 62
18 31
19 49
20 68
21 88
22 4
23 26
24 13
25 37
26 62
27 88
28 22
29 50
30 5
31 35
32 66
33 2
34 1
35 35
36 70
37 106
38 53
39 91
40 130
41 170
42 85
43 127
44 170
45 34
46 17
47 63
48 21
49 3
50 52
51 102
52 51
53 103
54 156
55 210
56 15
57 5
58 62
59 120
60 2
61 62
62 1
63 63
64 126
65 190
66 95
67 161
68 228
69 76

List of values

[1, 2, 4, 1, 5, 10, 16, 2, 10, 1, 11, 22, 34, 17, 31, 46, 62, 31, 49, 68, 88, 4, 26, 13, 37, 62, 88, 22, 50, 5, 35, 66, 2, 1, 35, 70, 106, 53, 91, 130, 170, 85, 127, 170, 34, 17, 63, 21, 3, 52, 102, 51, 103, 156, 210, 15, 5, 62, 120, 2, 62, 1, 63, 126, 190, 95, 161, 228, 76]