302844

Appears in sequences

• Number of (undirected) paths in the m X n knight graph (triangle read by rows with m = 1..n and n = 1..).at n=13A307025
• Numbers k whose number of divisors equals the number of divisors in each of R(k), k+R(k), R(k+R(k)), abs(k-R(k)), and R(abs(k-R(k))), where R(m) is the digit reversal of m and where the reversals of m do not equal m.at n=8A346141