179200

Appears in sequences

• Numbers that are the sum of 10 positive 10th powers.at n=32A004810
• Numbers that are the sum of 7 positive 11th powers.at n=9A004818
• Theta series of P_{11a} packing.at n=9A005953
• For n <= 6, entry of maximal modulus in the inverse of the n-th Hilbert matrix. For n >= 3, this is the (n-1,n-1)-th entry.at n=4A061065
• Least number m such that cardinality of InvPhi(m) = prime(n).at n=35A071389
• Stirling2 triangle with scaled diagonals (powers of 8).at n=24A075503
• Fourth column of triangle A075503.at n=3A076004
• Hook products of all partitions of 12.at n=19A093791
• Hook products of all partitions of 12.at n=20A093791
• Number of permutations of n elements without cycles whose length is a multiple of 3.at n=9A102736
• A triangle of coefficients of a product polynomial sequence based on Chebyshev T[(x,n): p(x,n) = Product_{m=0..n} Sum_{i=0..m} T(x,i).at n=57A139808
• E.g.f.: sm^-1(x) = Sum_{n>=0} a(n)*x^(3n+1)/(3n+1)!; a(n) = coefficient of x^(3n+1)/(3n+1)! in the Maclaurin expansion of the inverse of the Dixon elliptic function sm(x,0).at n=3A158111
• 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=29A189765
• Maximum modulus in the inverse of Hilbert's matrix.at n=4A210356
• Triangle T(n,k) read by rows: T(n,k) is the number of unrooted hypertrees on n labeled vertices with k hyperedges, n >= 2, 1 <= k <= n-1.at n=24A210587
• Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which none of the cycle lengths are divisible by k.at n=38A213280
• Number of permutations on [n] admitting a ninth root.at n=9A247007
• Number of permutations on [n] that are the n-th power of a permutation.at n=9A247009
• Number of cyclic subgroups of the group GL(2, Z(n)), counting conjugates as distinct.at n=39A316560
• a(n) = n! * [x^n] exp(Sum_{k=1..n, gcd(n,k) = 1} x^k / k).at n=9A335088