The number of steps for a knight to be trapped when moving on a spirally numbered hexagonal board to the lowest available unvisited cell and starting at cell n.

A333683

The number of steps for a knight to be trapped when moving on a spirally numbered hexagonal board to the lowest available unvisited cell and starting at cell n.

Terms

    a(0) =83965a(1) =738091a(2) =277614a(3) =252431a(4) =731818a(5) =731818a(6) =765367a(7) =622644a(8) =252431a(9) =252431a(10) =1409949a(11) =1720441a(12) =512861a(13) =925161a(14) =251386a(15) =1967478a(16) =24228a(17) =759058a(18) =738091a(19) =765367a(20) =813609a(21) =251386a(22) =427289a(23) =3220511a(24) =48709a(25) =151878a(26) =231983a(27) =121515a(28) =113147a(29) =894298

External references