cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A302928 Maximum number of 4's possible in an infinite Minesweeper grid with n mines.

Original entry on oeis.org

0, 0, 0, 2, 2, 4, 6, 6, 7, 8, 10, 12, 12, 13, 14, 16, 18, 18, 19, 21, 22, 24, 24, 26, 28, 30, 30, 31, 33, 34, 36, 36
Offset: 1

Views

Author

Dmitry Kamenetsky, Apr 16 2018

Keywords

Comments

Question: what is the maximum value possible for (a(n) - n)? The current record is 5, which occurs at n=31.
There is no maximum. We can take k copies of the 17-mine configuration and place them sufficiently far apart to get 18k fours. So a(17k) - 17k >= 18k - 17k = k can get arbitrarily large. A possibly more interesting question is to ask about the maximum ratio a(n)/n. - Yevhenii Diomidov, Jan 19 2022

Links

Crossrefs

Cf. A047345, A302929, A302930, A302931.

A302929 Maximum number of 5's possible in an infinite Minesweeper grid with n mines.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 2, 4, 4, 5, 6, 6, 7, 8, 10, 10, 11, 12, 13, 14, 15, 16, 16, 17, 18, 20, 20, 22, 22, 23, 24, 26
Offset: 1

Views

Author

Dmitry Kamenetsky, Apr 16 2018

Keywords

Links

Crossrefs

Cf. A047345, A302928, A302930, A302931.

A302930 Maximum number of 6's possible in an infinite Minesweeper grid with n mines.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18
Offset: 1

Views

Author

Dmitry Kamenetsky, Apr 16 2018

Keywords

Links

Crossrefs

Cf. A047345, A302928, A302929, A302931.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.