79380

Appears in sequences

• Number of permutations of an n-set containing a 4-cycle.at n=9A029571
• Product of nonzero digits of A066549(n).at n=7A066582
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=26A074310
• Number of n X n matrices over GF(4) with rank n-1.at n=2A085404
• Numbers k such that if you subtract k-reversed from k you get a natural number with the same digits as k.at n=27A121969
• Triangle T(n,m)=m*n*binomial(m+n,m)^2/(2*(m+n)) read by rows.at n=14A131635
• The matrix product A127773 * A001263 of infinite lower triangular matrices.at n=40A132818
• A001263 * A127773.at n=49A132819
• E(n,k), an additive decomposition of the Euler number (triangle read by rows).at n=41A154341
• A partition product of Stirling_2 type [parameter k = -3] with biggest-part statistic (triangle read by rows).at n=25A157399
• Number of ways to place 2 nonattacking queens on an n X n toroidal board.at n=20A172517
• Triangle T(n, k) = (n/2)*binomial(n-1, k-1)*binomial(n-1, k) with T(n, 0) = T(n, n) = 1, read by rows.at n=60A174116
• a(n) = C(2n,n) * (7^n/n!^2) * Product_{k=0..n-1} (7k+2)*(7k+5).at n=2A185402
• Triangle in which row n has the n*(n+1)/2 elements of the lower triangular part of the inverse of the n-th order Hilbert matrix.at n=25A189765
• Numbers with prime factorization pq^2r^2s^4.at n=9A190319
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=34A212863
• Triangle read by rows, T(n,k) = C(n,k)*n!/(floor(n/2)!)^2, n>=0, 0<=k<=n.at n=49A253666
• Triangle read by rows, T(n,k) = C(n,k)*n!/(floor(n/2)!)^2, n>=0, 0<=k<=n.at n=50A253666
• Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.at n=39A293211
• a(n) is the smallest dividend m of the Euclidean division m = d*n + r such that m/d = r/n.at n=23A335717