The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A366998 a(n) is the numerator of the maximum expected number of steps of a random walk on the square lattice until it lands on a mined lattice point, given that mines are placed on all but n points. 4
 0, 1, 4, 12, 28, 8, 124, 128, 263, 9, 1303, 519707, 380, 3435 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS For all n <= 13 except n = 3, the optimal placement of the mine-free points is unique, up to rotations and reflections with respect to the starting point. See linked illustration. LINKS Table of n, a(n) for n=0..13. Pontus von Brömssen, Illustration of the optimal mine-free points for n = 1..13. (The random walk starts at the black dot.) Pontus von Brömssen, Plot of a(n)/A366999(n) vs n, using Plot2. EXAMPLE For n = 0, the random walk stops before it can take any step, so a(0) = 0. For n = 1, only the mine at the starting point can be swept, so the random walk always stops after 1 step and a(1) = 1. For n = 2, the starting point and one adjacent point can be swept. The random walk then has probability 1/4 of surviving at each step, which implies that the expected number of steps is 4/3, so a(2) = 4. (The number of steps follows a geometric distribution.) CROSSREFS Cf. A365964, A366999 (denominators), A369368 (hexagonal lattice), A369370 (triangular lattice). Sequence in context: A306055 A212522 A207408 * A064444 A072182 A009906 Adjacent sequences: A366995 A366996 A366997 * A366999 A367000 A367001 KEYWORD nonn,frac,more AUTHOR Pontus von Brömssen, Nov 01 2023 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 July 13 15:08 EDT 2024. Contains 374284 sequences. (Running on oeis4.)