cp's OEIS Frontend

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.

%I A223562 #6 Jun 02 2025 08:30:18
%S A223562 46656,1594323,423412929,120212193177,36498667573629,
%T A223562 11308909481307639,3541866135681593043,1114941149859455947413,
%U A223562 351887363030832474896073,111203699598220587941621475,35164980499881960181025740341
%N 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.
%C A223562 Row 7 of A223556
%H A223562 R. H. Hardin, <a href="/A223562/b223562.txt">Table of n, a(n) for n = 1..210</a>
%e A223562 Some solutions for n=3
%e A223562 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
%e A223562 ..0..3..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0
%e A223562 ..0..3..0....0..1..0....0..3..0....0..3..0....0..3..0....0..3..0....0..3..0
%e A223562 ..0..2..1....0..1..0....0..1..4....0..3..0....0..2..0....0..3..4....0..3..0
%e A223562 ..5..4..1....4..3..5....0..3..0....0..3..4....5..2..1....4..1..0....0..1..0
%e A223562 ..3..0..3....5..2..5....5..2..5....4..3..4....1..4..5....4..1..0....0..1..0
%e A223562 ..3..4..5....5..3..0....0..2..5....4..3..0....5..3..5....0..2..1....0..1..4
%K A223562 nonn
%O A223562 1,1
%A A223562 _R. H. Hardin_ Mar 22 2013