The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A357500

Largest number of nodes of an induced path in the n X n knight graph.
(history; published version)

#23 by Michel Marcus at Tue Jan 31 01:13:15 EST 2023

STATUS

reviewed

approved

#22 by Joerg Arndt at Tue Jan 31 01:12:31 EST 2023

STATUS

proposed

reviewed

#21 by Jon E. Schoenfield at Mon Jan 30 22:20:37 EST 2023

STATUS

editing

proposed

#20 by Jon E. Schoenfield at Mon Jan 30 22:20:35 EST 2023

REFERENCES

Thomas Dawson, Échecs Féeriques, L’'Échiquier, volume 2, issue 2, 1930; issue 3, 1931.

STATUS

proposed

editing

#19 by Michel Marcus at Mon Jan 30 14:28:03 EST 2023

STATUS

editing

proposed

#18 by Michel Marcus at Mon Jan 30 14:28:00 EST 2023

REFERENCES

Donald E. Knuth, The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2, Addison-Wesley, 2023. See excercise exercise 7.2.2.1-172 and its solution.

STATUS

proposed

editing

#17 by Pontus von Brömssen at Mon Jan 30 14:10:46 EST 2023

STATUS

editing

proposed

#16 by Pontus von Brömssen at Mon Jan 30 14:06:50 EST 2023

FORMULA

a(n) ~ = n^2/2 + O(n) (Beluhov 2023). - Pontus von Brömssen, Jan 30 2023

STATUS

proposed

editing

#15 by Pontus von Brömssen at Mon Jan 30 13:51:17 EST 2023

STATUS

editing

proposed

#14 by Pontus von Brömssen at Mon Jan 30 13:46:59 EST 2023

REFERENCES

Donald E. Knuth, The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2. , Addison-Wesley, 2023. See excercise 7.2.2.1-172 and its solution.