Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160392 Length of the longest directed, closed, non-intersecting rook path on an n X n chess board avoiding right turns on squares of one color and avoiding left turns on the other color. +0
1
0, 0, 8, 12, 16, 20, 40, 48, 62 (list; graph; listen)
OFFSET

1,3

COMMENT

Turns must be chromatically correct. e.g. n=3, R=Right Turn, A=Ahead, longest path is 8

RAR

A A

RAR

CROSSREFS

Sequence in context: A063539 A081925 A049199 this_sequence A078609 A084809 A110558

Adjacent sequences: A160389 A160390 A160391 this_sequence A160393 A160394 A160395

KEYWORD

hard,nonn

AUTHOR

David J Scambler (dscambler(AT)bmm.com), May 12 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research