1039104

Appears in sequences

• On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square.at n=9A086346
• The smallest number k which, when written in base n, has a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together contain the digits 0,1,...,(n-1) exactly once. Set a(n) = -1 if no such k exists.at n=7A372249
• The smallest number k which, when written in base n, has a factorization k = f_1*f_2*...*f_r where f_i >= 1 and the digits of {k, f_1, f_2, ..., f_r} together contain the digits 0,1,...,(n-1) exactly once. Set a(n) = -1 if no such k exists.at n=12A372294