A302980 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A302980

Size of the smallest square Minesweeper grid that allows each number from 0 to 8 to appear exactly n times.

5, 7, 8, 9, 10, 11, 12, 13, 13, 14 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,1`
	LINKS	`Table of n, a(n) for n=1..10.` `Dmitry Kamenetsky, The first 10 solutions` `Dmitry Kamenetsky, All numbers in a 5x5 Minesweeper grid</a, Puzzling StackExchange, September 2019.` `Wikipedia, Minesweeper.`
	CROSSREFS	`Sequence in context: A254274 A068001 A213443 * A242963 A191846 A068213` `Adjacent sequences: A302977 A302978 A302979 * A302981 A302982 A302983`
	KEYWORD	`nonn,more`
	AUTHOR	`Dmitry Kamenetsky, Apr 16 2018`
	STATUS	`approved`

Last modified June 15 00:00 EDT 2021. Contains 345041 sequences. (Running on oeis4.)