45984

Appears in sequences

• 6 X 6 X 6 triangular graph coloring a rectangular array: number of n X 1 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=5A223363
• 6 X 6 X 6 triangular graph coloring a rectangular array: number of n X 6 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=0A223368
• 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=15A223370
• 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=20A223370
• Number of equivalence classes of Dyck paths of semilength n for the consecutive pattern UDUDD, where U=(1,1) and D=(1,-1).at n=21A317639
• Numbers k such that 445*2^k+1 is prime.at n=33A323151