24883200000
domain: N
Appears in sequences
- a(n) = (5*n)^5.at n=24A016853
- a(n) = (6*n)^5.at n=20A016913
- a(n) = (7*n + 1)^5.at n=17A016997
- a(n) = (8*n)^5.at n=15A017069
- a(n) = (9*n + 3)^5.at n=13A017201
- a(n) = (10*n)^5.at n=12A017273
- a(n) = (11*n + 10)^5.at n=10A017513
- a(n) = (12*n)^5.at n=10A017525
- a(n) = (n!)^n.at n=5A036740
- a(n) = binomial(n+1, 2)^5.at n=14A059860
- n-th prime's factorial raised to n-th prime power.at n=2A068210
- A generalization of triangle A071951 (Legendre-Stirling).at n=15A090217
- Triangular array of A(n,k) for n>=1 and 0<=k<=n^2 equal the number of permutations of the set {1,2,...,n}^2 such that first coordinates of first k elements are nondecreasing and second coordinates of the remaining n^2-k elements are nondecreasing.at n=34A261602
- Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.at n=24A264656
- Array read by ascending antidiagonals: A(n,k) is the number of acyclic de Bruijn sequences of order k and alphabet of size n, with k > 0.at n=16A373341