Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Dec 11 2024 09:27:42
%S 5,6,39,156,922,5060,31165,196605,1301490,8844147,61504902,434181564,
%T 3098427480,22270496859,160854381441
%N a(n) is the number of paths of a chess king on square a1 to reach a position outside an 8 X 8 chessboard after n steps.
%C The king visits the Moore neighborhood, and the 8 possible moves relative to its current position are E, NE, N, NW, W, SW, S, and SE.
%e a(1) = 5: only the 3 moves E, NE, and N end on target squares on the chessboard, the other 5 leave the board.
%e a(2) = 6: the 6 combinations of step directions leaving the board in exactly 2 moves are [E,SW], [E,S], [E,SE], [N,NE], [N,E], and [N,SE].
%Y Cf. A140518, A376609, A376610, A377018.
%K nonn,walk,more,new
%O 1,1
%A _Hugo Pfoertner_, Dec 10 2024