The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A006075 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A006075

Minimal number of knights needed to cover an n X n board.
(history; published version)

#60 by Peter Luschny at Mon Jun 07 04:47:11 EDT 2021

STATUS

reviewed

approved

#59 by Joerg Arndt at Mon Jun 07 02:23:39 EDT 2021

STATUS

proposed

reviewed

#58 by Michel Marcus at Sun Jun 06 17:36:20 EDT 2021

STATUS

editing

proposed

#57 by Michel Marcus at Sun Jun 06 17:36:17 EDT 2021

EXTENSIONS

a(20) = 62 added from the Contest Center web site by N. J. A. Sloane, Mar 02 2006

a(21) = 68 - _added by _Andy Huchala_, Jun 06 2021

STATUS

proposed

editing

#56 by Andy Huchala at Sun Jun 06 16:44:47 EDT 2021

STATUS

editing

proposed

#55 by Andy Huchala at Sun Jun 06 16:42:54 EDT 2021

LINKS

Andy Huchala, <a href="/A006075/a006075.py3.txt">Python program</a>.

Andy Huchala, <a href="/A006075/a006075.py3.txt">Python program</a>

Discussion

Sun Jun 06

16:44

Andy Huchala: I'm not sure whether or not to leave Frank's bound for a(21) (which ended up being spot on) so I'll just leave it as is.

#54 by Andy Huchala at Sun Jun 06 16:42:15 EDT 2021

DATA

1, 4, 4, 4, 5, 8, 10, 12, 14, 16, 21, 24, 28, 32, 36, 40, 46, 52, 57, 62, 68

LINKS

Andy Huchala, <a href="/A006075/a006075.py3.txt">Python program</a>

EXTENSIONS

a(21) = 68 - Andy Huchala, Jun 06 2021

STATUS

approved

editing

#53 by Michel Marcus at Mon Mar 15 12:36:51 EDT 2021

STATUS

reviewed

approved

#52 by Joerg Arndt at Mon Mar 15 12:23:19 EDT 2021

STATUS

proposed

reviewed

#51 by Andrey Zabolotskiy at Mon Mar 15 12:00:55 EDT 2021

STATUS

editing

proposed