login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323763 Squares visited by gnu (A.K.A. wildebeest; (1,2)+(1,3)-leaper chess piece) moves on a spirally numbered board and moving to the lowest available unvisited square at each step. 0
1, 10, 3, 6, 9, 4, 7, 2, 5, 8, 11, 14, 18, 15, 12, 16, 19, 22, 41, 17, 33, 30, 34, 13, 27, 23, 20, 24, 44, 40, 21, 39, 36, 60, 31, 53, 26, 46, 25, 28, 32, 29, 51, 47, 75, 42, 45, 71, 74, 70, 38, 35, 59, 56, 86, 50, 78, 49, 52, 80, 83, 79, 115, 73, 107, 67, 64 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In fairy chess the (1,2)+(1,3)-leaper is called a Gnu. - Vaclav Kotesovec, Jan 28 2019

Board is numbered with the square spiral:

.

  17--16--15--14--13

   |               |

  18   5---4---3  12   .

   |   |       |   |

  19   6   1---2  11   .

   |   |           |

  20   7---8---9--10   .

   |

  21--22--23--24--25--26

.

This sequence is finite: At step 12899744968 square 12851850258 is visited, after which there are no unvisited squares within one move.

LINKS

Table of n, a(n) for n=1..67.

Wikipedia, Fairy chess piece

Wikipedia, Wildebeest Chess

CROSSREFS

Cf. A316667, A317106.

Sequence in context: A167764 A241887 A182493 * A316667 A323808 A110409

Adjacent sequences:  A323760 A323761 A323762 * A323764 A323765 A323766

KEYWORD

nonn,fini

AUTHOR

Jonathan Allan, Jan 26 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 01:17 EDT 2019. Contains 321450 sequences. (Running on oeis4.)