The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324274 a(n) is the number of squares visited by a single pawn move for an even square and a double pawn move for an odd square on a diagonally numbered board and moving to the lowest available unvisited square of different parity at each step from subsequent starting squares n; or a(n) = 0 for an infinite length. 4
 20, 0, 8, 17, 6, 9, 4, 7, 0, 11, 16, 5, 18, 0, 10, 19, 8, 19, 8, 11, 12, 25, 6, 9, 6, 9, 0, 13, 24, 7, 20, 7, 20, 0, 12, 15, 24, 21, 26, 21, 10, 21, 10, 13, 14, 27, 8, 27, 8, 11, 8, 11, 0, 15, 16, 33, 22, 9, 22, 9, 22, 9, 22, 0, 14, 17, 32, 23 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS It is conjectured that all starting squares will either have a finite length or reach the top row of the board at square 2 first and then follow the sequence for a(2) to infinity. A324275 contains numbers n for which A324274(n) = 0. LINKS Table of n, a(n) for n=1..68. EXAMPLE a(1) is the length of A324273. a(2) has an infinite length as it will follow a repeating pattern along the top row of the numbered board. CROSSREFS Cf. A316588, A324273, A324275. Sequence in context: A221873 A278073 A365912 * A070708 A370308 A200430 Adjacent sequences: A324271 A324272 A324273 * A324275 A324276 A324277 KEYWORD nonn AUTHOR Jan Koornstra, Feb 20 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 00:22 EDT 2024. Contains 373492 sequences. (Running on oeis4.)