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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A316670 Squares visited by bishop moves on a diagonally numbered board and moving to the lowest available unvisited square at each step. 5
1, 5, 4, 6, 14, 11, 12, 13, 15, 27, 22, 23, 24, 25, 26, 28, 44, 37, 38, 39, 40, 41, 42, 43, 45, 65, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 90, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 91, 119, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Board is numbered as follows:

   1  2  4  7 11 16  .

   3  5  8 12 17  .

   6  9 13 18  .

  10 14 19  .

  15 20  .

  21  .

   .

Same as A316588 but with bishop move instead of knight move.

LINKS

Daniël Karssen, Table of n, a(n) for n = 1..10000

Daniël Karssen, Figure showing the first 10 steps of the sequence

CROSSREFS

Cf. A316588, A316668, A316669, A316671.

Sequence in context: A011502 A270841 A097995 * A234745 A019124 A019323

Adjacent sequences:  A316667 A316668 A316669 * A316671 A316672 A316673

KEYWORD

nonn

AUTHOR

Daniël Karssen, Jul 15 2018

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 May 30 08:04 EDT 2020. Contains 334712 sequences. (Running on oeis4.)