56210

Appears in sequences

• T(2n-1,n-2), T given by A026659.at n=7A026664
• Number of labeled rooted trees with n nodes and 9 leaves.at n=1A055310
• a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=30A070902
• Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (5*k - 4)*(m*k - (m - 1))*T(n - 1, k) where m = 0.at n=32A166973
• Triangle read by rows, T(n, k) = RisingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.at n=44A362788
• Expansion of 1/( Product_{k=0..4} (1 - (5*k+1) * x) ).at n=3A383635