|
|
A223562
|
|
Petersen graph (3,1) coloring a rectangular array: number of 7Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0
|
|
1
|
|
|
46656, 1594323, 423412929, 120212193177, 36498667573629, 11308909481307639, 3541866135681593043, 1114941149859455947413, 351887363030832474896073, 111203699598220587941621475, 35164980499881960181025740341
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
..0..3..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0
..0..3..0....0..1..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0
..0..2..1....0..1..0....0..1..4....0..3..0....0..2..0....0..3..4....0..3..0
..5..4..1....4..3..5....0..3..0....0..3..4....5..2..1....4..1..0....0..1..0
..3..0..3....5..2..5....5..2..5....4..3..4....1..4..5....4..1..0....0..1..0
..3..4..5....5..3..0....0..2..5....4..3..0....5..3..5....0..2..1....0..1..4
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|