121418domain: NAppears in sequencesa(n) = n + Fibonacci(n+1).at n=25A081659Number of distinct n-step paths of a knight moving on an n X n chessboard, starting to at a corner and not visiting any cell twice.at n=7A272568