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!)
A223500 Petersen graph (3,1) coloring a rectangular array: number of nX4 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 1

%I #4 Mar 21 2013 04:40:54

%S 27,631,16323,426359,11148439,291545903,7624417031,199391762123,

%T 5214442630935,136366781617267,3566229514618067,93263130563653603,

%U 2438993757290874987,63783946691623236183,1668061610819558039475

%N Petersen graph (3,1) coloring a rectangular array: number of nX4 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

%C Column 4 of A223504

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

%F Empirical: a(n) = 31*a(n-1) -127*a(n-2) -20*a(n-3) +705*a(n-4) -1027*a(n-5) +499*a(n-6) -60*a(n-7)

%e Some solutions for n=3

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

%e ..4..3..4..3....4..1..4..5....5..3..5..3....4..3..4..1....0..1..4..1

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 21 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 April 21 07:21 EDT 2024. Contains 371850 sequences. (Running on oeis4.)