9797760
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) = binomial(n,k)*6^(n-k)*6^k, 0<=k<=n.at n=31A038260
- Triangle read by rows: T(n,k) = binomial(n,k)*6^(n-k)*6^k, 0<=k<=n.at n=32A038260
- a(n) = 3*n*n!.at n=9A052673
- Expansion of e.g.f. x^3/(1-3*x).at n=8A052678
- Unrelated-factorial numbers: product of numbers unrelated to n (numbers which have a common divisor with n but do not divide n).at n=26A070251
- a(1) = 1, a(2) = 2; for n>2, a(n) = 3*(n-2)*(n-2)!.at n=10A083746
- a(n) = (n^3-n)*6^n.at n=5A128964
- Number of entries in the second cycles of all permutations of {1,2,...,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=9A138772
- a(n) = binomial(n+4, 4)*6^n.at n=6A139626
- Triangle interpolating between the subsets of an n-set (A000079) and the trees on n labeled nodes (A000272) (read by rows).at n=32A154715
- Triangle T(n, k, q) = n!*(n+1)!*q^k/((n-k)!(n-k+1)!) if floor(n/2) > k-1, otherwise n!*(n+1)!*q^(n-k)/(k!*(k+1)!) for q = 3, read by rows.at n=48A174451
- Triangle T(n, k, q) = n!*(n+1)!*q^k/((n-k)!(n-k+1)!) if floor(n/2) > k-1, otherwise n!*(n+1)!*q^(n-k)/(k!*(k+1)!) for q = 3, read by rows.at n=51A174451
- Number of permutations of 9..n+8 with no element greater than or equal to the sum of its neighbors.at n=10A180897
- Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=46A185105
- Array read by antidiagonals: a(i,j) is the number of ways of labeling a tableau of shape (i,1^j) with the integers 1, 2, ... i+j-2 (each label being used once) such that the first row is decreasing, and the first column has m-1 labels.at n=46A226167
- Triangle read by rows where T(n,k), n>=1, 1<=k<=n is the number of (0,1)-matrices of size n with the first row and column sum = k and remaining sums = 1.at n=46A308498
- a(n) is the lowest nonnegative exponent k such that n!^k is the product of the divisors of n!.at n=35A344687
- Triangle read by rows: T(n,k) = (-1)^(n-k)*binomial(n, k)*(k+3)^n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.at n=31A362353
- a(n) = product of numbers k < n such that 1 < gcd(k,n) and rad(k) != rad(n).at n=26A381674
- Smallest k for which the number of divisors d of k such that A000005(d) = A000005(k/d) is equal to n.at n=22A391603