A076425 - cp's OEIS frontend

A076425 Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.

n	a(n)
1	2074
2	2113
3	2179
4	2914
5	3111
6	4112
7	4371
8	4390
9	4456
10	4956
11	4978
12	5185
13	5450
14	5750
15	6474
16	6585
17	6827
18	7248
19	7259
20	7285
21	7467
22	8175
23	8625
24	8647
25	9378
26	9711
27	9739
28	10199
29	10975
30	11407
31	11752
32	12006
33	12232
34	12338
35	12445
36	12826
37	13224
38	13396

[2074, 2113, 2179, 2914, 3111, 4112, 4371, 4390, 4456, 4956, 4978, 5185, 5450, 5750, 6474, 6585, 6827, 7248, 7259, 7285, 7467, 8175, 8625, 8647, 9378, 9711, 9739, 10199, 10975, 11407, 11752, 12006, 12232, 12338, 12445, 12826, 13224, 13396]

cp's OEIS Frontend

A076425 Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.

Table of values

List of values