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.

A347243 Numbers k such that when iterating the map x -> A000593(x), we will not encounter a term x (after the starting point x=k) whose largest prime factor would be at least as large as A006530(k), before 1 is eventually reached.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 19
18 20
19 21
20 22
21 23
22 24
23 26
24 28
25 29
26 30
27 31
28 32
29 33
30 34
31 35
32 37
33 38
34 39
35 40
36 41
37 42
38 43
39 44
40 46
41 47
42 48
43 51
44 52
45 53
46 56
47 57
48 58
49 59
50 60
51 61
52 62
53 64
54 65
55 66
56 67
57 68
58 69
59 70
60 71
61 73
62 74
63 76
64 77
65 78
66 79
67 80
68 82
69 83
70 84
71 85
72 86
73 87
74 88
75 89
76 91
77 92
78 93
79 94
80 95
81 96
82 97
83 101

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 26, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 51, 52, 53, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 76, 77, 78, 79, 80, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 101]