Re: Bishop moves
- To: mathgroup at smc.vnet.net
- Subject: [mg20805] Re: Bishop moves
- From: Rob Pratt <rpratt at email.unc.edu>
- Date: Sun, 14 Nov 1999 18:13:54 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
See
www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=038496
which gives the following:
Greetings from the On-Line Encyclopedia of Integer Sequences!
Here is Sequence A038496 (this will take a moment):
ID Number: A038496
Sequence: 1,1,1,3,9,53,465,9815,288601,19609857
Name: Self-avoiding paths with diagonal steps from corner to opposite
corner of n x n grid.
Offset: 1
Author(s): David Wilson (wilson at ctron.com), based on a suggestion of
Felice
Russo (f-russo1 at ti.com)
I found this sequence by first using Allan Hayes's Backtrack2 command to
compute the terms up through the 8 x 8 board and then submitting these
terms to the EIS lookup engine. Wilson has many more sequences along
these lines.
Rob Pratt
Department of Operations Research
The University of North Carolina at Chapel Hill
rpratt at email.unc.edu
http://www.unc.edu/~rpratt/