86986

Appears in sequences

• Number of n-step mappings with 4 inputs.at n=31A005945
• a(n) = (2*n+1)*(3*n+1)*(4*n+1).at n=15A033591
• Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.at n=33A359694