T(n,k)=Generalized Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

A223440

T(n,k)=Generalized Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.

Terms

    a(0) =16a(1) =48a(2) =48a(3) =144a(4) =256a(5) =144a(6) =432a(7) =1376a(8) =1376a(9) =432a(10) =1296a(11) =7424a(12) =14112a(13) =7424a(14) =1296a(15) =3888a(16) =40160a(17) =147520a(18) =147520a(19) =40160a(20) =3888a(21) =11664a(22) =217600a(23) =1562176a(24) =3099264a(25) =1562176a(26) =217600a(27) =11664a(28) =34992a(29) =1180256

External references