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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A369369 Denominator of the maximum expected number of steps of a random walk on the cells of the hexagonal lattice before it lands on a mined cell, given that all but n cells are mined. 3
1, 1, 5, 2, 13, 74, 961, 3, 871, 103, 319, 61289 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
See A369368 for details.
LINKS
Pontus von Brömssen, Illustration of the optimal mine-free cells for n = 1..11. (The random walk starts at the black dot.)
CROSSREFS
Cf. A369368 (numerators), A366999 (square lattice), A369371 (triangular lattice).
Sequence in context: A085436 A277710 A286148 * A194048 A158868 A104634
KEYWORD
nonn,frac,more
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 12:36 EDT 2024. Contains 372170 sequences. (Running on oeis4.)