151200000

Appears in sequences

• 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=30A098909
• a(1) = 1; for n>1, a(n) = least multiple of a(n-1) such that the termwise concatenation of a(n), a(n-1),...a(2), a(1) is prime.at n=10A111674
• Number of endofunctions on [n] where the smallest cycle length equals 6.at n=4A246193
• Number of endofunctions on [n] whose cycle lengths are multiples of 6.at n=10A246613