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.
%I A302928 #16 Jan 19 2022 14:34:08 %S A302928 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, %T A302928 30,31,33,34,36,36 %N A302928 Maximum number of 4's possible in an infinite Minesweeper grid with n mines. %C A302928 Question: what is the maximum value possible for (a(n) - n)? The current record is 5, which occurs at n=31. %C A302928 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 %H A302928 Dmitry Kamenetsky, <a href="/A302928/a302928.txt">The first 32 solutions</a> %H A302928 Wikipedia, <a href="https://en.wikipedia.org/wiki/Minesweeper_(video_game)">Minesweeper</a>. %Y A302928 Cf. A047345, A302929, A302930, A302931. %K A302928 nonn,more %O A302928 1,4 %A A302928 _Dmitry Kamenetsky_, Apr 16 2018