231488

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=23A076424
• a(n) = numerator(Bernoulli(2*n)*(1/2 - n)! / sqrt(Pi)).at n=8A335750