login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A223372 3X3 square grid graph coloring a rectangular array: number of nX1 0..8 arrays where 0..8 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph 1

%I #4 Mar 19 2013 17:07:52

%S 9,24,68,192,544,1536,4352,12288,34816,98304,278528,786432,2228224,

%T 6291456,17825792,50331648,142606336,402653184,1140850688,3221225472,

%U 9126805504,25769803776,73014444032,206158430208,584115552256

%N 3X3 square grid graph coloring a rectangular array: number of nX1 0..8 arrays where 0..8 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph

%C Column 1 of A223379

%H R. H. Hardin, <a href="/A223372/b223372.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 8*a(n-2) for n>3

%e Some solutions for n=3

%e ..7....3....4....5....2....7....6....2....6....3....5....6....7....7....1....1

%e ..4....4....1....4....5....4....7....5....3....6....8....7....4....8....4....2

%e ..7....3....0....3....2....1....4....4....0....7....5....6....3....7....1....1

%e Vertex neighbors:

%e 0 -> 1 3

%e 1 -> 0 2 4

%e 2 -> 1 5

%e 3 -> 0 4 6

%e 4 -> 3 1 5 7

%e 5 -> 4 2 8

%e 6 -> 3 7

%e 7 -> 6 4 8

%e 8 -> 7 5

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 19 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)