1367187500

Appears in sequences

• 3 X 3 X 3 triangular graph without horizontal edges coloring a rectangular array: number of n X 1 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=24A223346
• Hypotenuses for which there exist exactly 11 distinct integer triangles.at n=19A290501