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.

A120684 Integers m such that the sequence defined by f(0)=m and f(n+1)=1+gpf(f(n)), with gpf(n) being the greatest prime factor of n (A006530), ends up in the repetitive cycle 3 -> 4 -> 3 -> ...

Table of values

n a(n)
0 3
1 6
2 7
3 9
4 12
5 14
6 18
7 19
8 21
9 24
10 27
11 28
12 29
13 31
14 35
15 36
16 38
17 42
18 43
19 48
20 49
21 54
22 56
23 57
24 58
25 59
26 62
27 63
28 67
29 70
30 72
31 73
32 76
33 79
34 81
35 84
36 86
37 87
38 89
39 93
40 95
41 96
42 98
43 101
44 103
45 105
46 108
47 109
48 112
49 114
50 116
51 118
52 124
53 126
54 127
55 129
56 131
57 133
58 134
59 137
60 140
61 144
62 145
63 146

List of values

[3, 6, 7, 9, 12, 14, 18, 19, 21, 24, 27, 28, 29, 31, 35, 36, 38, 42, 43, 48, 49, 54, 56, 57, 58, 59, 62, 63, 67, 70, 72, 73, 76, 79, 81, 84, 86, 87, 89, 93, 95, 96, 98, 101, 103, 105, 108, 109, 112, 114, 116, 118, 124, 126, 127, 129, 131, 133, 134, 137, 140, 144, 145, 146]