4644864

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=40A019575
• a(n)= abs(det[A000166(i+j+1)]), i,j=0...n, is the absolute value of the Hankel determinant of order n+1 of the derangements numbers, cf. A000166.at n=4A101800
• Triangle read by rows: terms T(n,k) of a binomial decomposition of n*(n-1) as Sum(k=0..n)T(n,k).at n=49A244139
• Irregular triangle T(n,m), denominators of coefficients in a power/Fourier series expansion of the plane pendulum's exact time dependence.at n=14A274131
• Irregular triangle T(n,m), denominators of coefficients in a power/Fourier series expansion of the plane pendulum's exact time dependence.at n=16A274131
• Numbers k such that k*p is divisible by k+p, where p > 0 and p = A007954(k) = the product of digits of k.at n=31A334679
• a(n) = (1/2) * Sum_{k=0..floor(n/2)} 2^k * binomial(2*k+2,2*n-4*k+1).at n=19A387551