A076424 - cp's OEIS frontend

A076424 Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.

n	a(n)
1	1
2	2
3	3
4	12
5	31
6	23
7	56
8	102
9	193
10	257
11	570
12	1129
13	4970
14	3229
15	11551
16	11969
17	24232
18	20094
19	24103
20	35996
21	100090
22	222284
23	116269
24	231488
25	388768
26	1751753
27	2046872
28	1140163
29	1149979
30	2156214
31	3199384
32	2971734
33	7018074
34	10163234
35	13135933

[1, 2, 3, 12, 31, 23, 56, 102, 193, 257, 570, 1129, 4970, 3229, 11551, 11969, 24232, 20094, 24103, 35996, 100090, 222284, 116269, 231488, 388768, 1751753, 2046872, 1140163, 1149979, 2156214, 3199384, 2971734, 7018074, 10163234, 13135933]

cp's OEIS Frontend

A076424 Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.

Table of values

List of values