login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A223551 Petersen graph (3,1) coloring a rectangular array: number of n X n 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
1, 27, 3249, 1795473, 4715559621, 59043582882099, 3541866135681593043, 1020092567883788131348995, 1412857454503152706541498629089, 9420448274769727958157865214329990383 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Diagonal of A223556

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..12

EXAMPLE

Some solutions for n=3

..0..1..4....0..3..4....0..3..4....0..3..0....0..3..4....0..2..0....0..3..4

..0..3..0....5..3..4....5..3..0....5..3..4....5..3..4....0..2..1....4..5..4

..0..2..1....4..5..2....4..3..4....4..3..0....0..3..0....5..4..1....4..1..2

CROSSREFS

Sequence in context: A132659 A104131 A132645 * A178631 A226531 A017559

Adjacent sequences:  A223548 A223549 A223550 * A223552 A223553 A223554

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 22 2013

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 21 09:15 EDT 2019. Contains 323441 sequences. (Running on oeis4.)