139158

Appears in sequences

• 6X6X6 triangular graph coloring a rectangular array: number of nX2 0..20 arrays where 0..20 label nodes of the fully triangulated graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=3A223364
• 6 X 6 X 6 triangular graph coloring a rectangular array: number of n X 4 0..20 arrays where 0..20 label nodes of the fully triangulated graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223366
• T(n,k)=6X6X6 triangular graph coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of the fully triangulated graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=11A223370
• T(n,k)=6X6X6 triangular graph coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of the fully triangulated graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=13A223370