360000000

Appears in sequences

• a(n) = binomial(n-1,2)*n^(n-3).at n=9A053507
• 10th binomial transform of (0,0,1,0,0,0,...).at n=9A081140
• 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=28A098909
• Triangle A061356 read right to left.at n=52A139526
• Triangle T(n,k) read by rows: T(n,k) is the number of unrooted hypertrees on n labeled vertices with k hyperedges, n >= 2, 1 <= k <= n-1.at n=43A210587
• Triangle read by rows: row n gives coefficients of expansion of Product_{k = 1..n-1} ((n + 1)*x + k), starting with lowest power.at n=43A220883
• Numbers m whose distinct prime factors are exactly the same as the distinct prime factors of each of the numbers obtained by deleting any single digit in the decimal expansion of m.at n=16A307764
• Triangle read by rows: T(0,0) = 1; T(n,k) = 10*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=38A317055