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.

A255140 a(1) = 1, a(n+1) = a(n)/gcd(a(n),n) if this gcd is > 1, else a(n+1) = a(n) + n + 2.

Table of values

n a(n)
1 1
2 4
3 2
4 7
5 13
6 20
7 10
8 19
9 29
10 40
11 4
12 17
13 31
14 46
15 23
16 40
17 5
18 24
19 4
20 25
21 5
22 28
23 14
24 39
25 13
26 40
27 20
28 49
29 7
30 38
31 19
32 52
33 13
34 48
35 24
36 61
37 99
38 138
39 69
40 23
41 65
42 108
43 18
44 63
45 109
46 156
47 78
48 127
49 177
50 228
51 114
52 38
53 19
54 74
55 37
56 94
57 47
58 106
59 53
60 114
61 19
62 82
63 41
64 106

List of values

[1, 4, 2, 7, 13, 20, 10, 19, 29, 40, 4, 17, 31, 46, 23, 40, 5, 24, 4, 25, 5, 28, 14, 39, 13, 40, 20, 49, 7, 38, 19, 52, 13, 48, 24, 61, 99, 138, 69, 23, 65, 108, 18, 63, 109, 156, 78, 127, 177, 228, 114, 38, 19, 74, 37, 94, 47, 106, 53, 114, 19, 82, 41, 106]

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

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