1851020

Appears in sequences

• 3 X 3 X 3 triangular graph without horizontal edges coloring a rectangular array: number of n X 3 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=5A223347
• 3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nX6 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=2A223350
• T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=30A223352
• T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=33A223352