1140163

Properties

Appears in sequences

• 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.at n=27A076424
• a(n) = A077708(n+1)/A077708(n).at n=31A077709
• Prime numbersat n=88612