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.

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

Table of values

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

List of values

[1, 3, 6, 2, 1, 7, 14, 2, 1, 11, 22, 2, 1, 15, 30, 2, 1, 19, 38, 2, 1, 23, 46, 2, 1, 27, 54, 2, 1, 31, 62, 2, 1, 35, 70, 2, 1, 39, 78, 2, 1, 43, 86, 2, 1, 47, 94, 2, 1, 51, 102, 2, 1, 55, 110, 2, 1, 59, 118, 2, 1, 63, 126, 2, 1, 67, 134, 2, 1, 71, 142, 2, 1]

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

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