787500

Appears in sequences

• 5-idempotent numbers.at n=5A050982
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.at n=49A059298
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.at n=50A059300
• a(n) = n^3*binomial(2*n, n)*Fibonacci(n)^2.at n=5A119698
• Triangle read by rows: T(n,k) is the number of labeled rooted trees of height at most 2 that have exactly k nodes at a distance 2 from the root; n>=1, 0<=k<=n-1.at n=49A216255
• Number of (n+1)X(2+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=5A250437
• Number of (n+1)X(6+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=1A250441
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=22A250443
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=26A250443
• Numbers m such that the concatenation of k and the k-th divisor of m is equal to m for some k.at n=33A258738
• a(n) = binomial(2*n, n) * n^n.at n=5A367271
• a(n) = binomial(n, k) * (n - k)^k where k = floor(n/2).at n=10A367274
• Triangle read by rows: T(n, k) = binomial(n, k - 1)*(k - 1)^(k - 1)*k*(n - k + 1)^(n - k).at n=34A369019