20094

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=17A076424
• Number of nondecreasing arrangements of n numbers in -7..7 with sum zero.at n=8A183915
• Number of strictly increasing arrangements of n numbers in -(n+2)..(n+2) with sum zero.at n=8A188176
• Convolution of A006068 (inverse of Gray code) with itself: a(n) = Sum_{k=1..n+1} A006068(k) * A006068(1+n-k).at n=44A268721