61200

Appears in sequences

• a(n) = n*(n-1)*(n-2)^2.at n=15A047927
• Expansion of e.g.f. 1/((1-2*x)*(1-x^2)).at n=6A052600
• Orders of the finite groups GL_2(K) when K is a finite field with q = A246655(n) elements.at n=9A059238
• Sum of terms in n-th row of A077316.at n=33A077318
• Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).at n=36A089480
• Numbers containing squares of Pythagorean triples in their divisor set.at n=16A096472
• Consider pairs m,n such that 1/(UnitarySigma(m))^(1/2)=1/(UnitarySigma(n))^(1/2)=k^(1/2)*(1/m^(1/2)-1/n^(1/2)), n<m. Sequence gives values of n.at n=1A144490
• Numbers with prime factorization pq^2r^2s^4.at n=6A190319
• Number of 0..n arrays x(0..3) of 4 elements without any interior element greater than both neighbors.at n=18A200887
• Nonzero coefficients of g.f. A(x) = 1 + 4*x^2 + 36*x^4 + 396*x^6 + ... satisfying (A-1)*(1+3/A)^3 = 256*x^2.at n=5A239112
• Number of partitions p of n such that (number of numbers of the form 3k in p) is a part of p.at n=45A241546
• Number of 2 X 2 matrices with entries in {0,1,...,n} and odd trace with no elements repeated.at n=19A279905
• Least k whose set of divisors contains exactly n Pythagorean triples, or 0 if no such k exists.at n=31A334382
• Order of the finite groups GL(m,q) [or GL_m(q)] in increasing order as q runs through the prime powers.at n=12A335384
• Numbers k such that A348271(k) > 2*k.at n=29A348521
• Numbers that are both exponential and nonexponential abundant numbers.at n=20A348627
• Coreful triperfect numbers: numbers k such that csigma(k) = 3*k, where csigma(k) is the sum of the coreful divisors of k (A057723).at n=5A364990
• Numbers k such that A380845(k) > 3*k.at n=37A380930
• Exponential abundant numbers that are not exponential unitary abundant.at n=8A391085
• Exponential Zumkeller numbers that are not exponential unitary Zumkeller numbers.at n=9A391090