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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A223498 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, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0 0
1, 19, 1519, 426359, 515473927, 2519813048575, 51596648899152901, 4382197669772597921079, 1555039484181265199709474223, 2303272223887812126256525632339813 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Diagonal of A223504

LINKS

Table of n, a(n) for n=1..10.

EXAMPLE

Some solutions for n=3

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

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

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

CROSSREFS

Sequence in context: A051847 A217830 A002115 * A054949 A242564 A068748

Adjacent sequences:  A223495 A223496 A223497 * A223499 A223500 A223501

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 21 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 18:10 EST 2018. Contains 317240 sequences. (Running on oeis4.)