10937500

Appears in sequences

• Triangle read by rows, T(n,k) = k^n*A056040(n), n>=0, 0<=k<=n.at n=33A195009
• 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=18A223346
• Hypotenuses for which there exist exactly 8 distinct integer triangles.at n=19A290499
• Triangle read by rows: T(n,k) = (-1)^(n-k)*binomial(n, k)*(k+3)^n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.at n=38A362353