9920232

Appears in sequences

• a(n) = number of unicyclic connected simple graphs whose cycle has length 4.at n=5A065889
• Triangle T(n,k) of numbers of connected (unicyclic) graphs with unique cycle of length k (3<=k<=n), on n labeled nodes.at n=22A098909
• Triangle read by rows: G(s, rho) = ((s-1)!/s)*Sum_{i=0..s-1} ((s-i)/i!)*(s*rho)^i.at n=42A122525
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph consists of a single node or has a unique cycle of length 4.at n=54A144209
• Triangle read by rows: T(n,k) = k*(n-1)!*n^(n-k-1)/(n-k)!, 1 <= k <= n.at n=38A259334
• Integers equal to the least common multiple of the set of numbers generated by all the differences between their consecutive divisors, taken in increasing order.at n=29A298045
• a(n) = Sum_{k=0..n} k^2 * 2^(n-k) * binomial(n,k).at n=12A383136