64225280

Appears in sequences

• Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=25A058843
• Consider the list s(1), s(2), ... of numbers that are products of exactly n primes; a(n) is the smallest s(j) whose decimal expansion ends in j.at n=21A186000
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 806", based on the 5-celled von Neumann neighborhood.at n=25A286834
• Triangle read by rows. T(n, k) = n^k * |Stirling1(n, k)|.at n=41A355007
• a(n) = n*(n-1)*(n- 2)^2*2^(n-4)/3.at n=15A391778