64988160

Appears in sequences

• Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.at n=18A108509
• Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.at n=19A108509
• Triangle read by rows: T(n,k) = number of open trails of length k starting and ending at fixed distinct vertices in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n*(n-1)/2.at n=60A357886
• Triangle read by rows: T(n,k) = number of open trails of length k starting and ending at fixed distinct vertices in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n*(n-1)/2.at n=61A357886
• Number of (undirected) Eulerian circuits on the complete graph K_{2n+1}.at n=2A369820