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!)
A369371 Denominator of the maximum expected number of steps of a random walk on the cells of the triangular lattice before it lands on a mined cell, given that all but n cells are mined. 3
1, 1, 2, 7, 1, 47, 4, 313, 19, 125, 31, 358, 22, 2, 364, 26, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
See A369370 for details.
LINKS
Pontus von Brömssen, Illustration of the optimal mine-free cells for n = 1..16. (The random walk starts at the black dot.)
CROSSREFS
Cf. A369370 (numerators), A366999 (square lattice), A369369 (hexagonal lattice).
Sequence in context: A372176 A372153 A372170 * A242207 A060465 A219177
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 August 16 10:17 EDT 2024. Contains 375174 sequences. (Running on oeis4.)