1149979

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=28A076424
• Primes of the form 4*n^3-5.at n=22A200732
• Prime numbersat n=89299