48000

Appears in sequences

• arcsin(tan(arcsinh(x)))=x+2/3!*x^3+24/5!*x^5+720/7!*x^7+48000/9!*x^9...at n=4A012161
• Second diagonal of A027539.at n=5A027544
• Number of primitive polynomials of degree n over GF(4).at n=10A027695
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*12^j.at n=11A038314
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.at n=13A038336
• Numbers whose base-6 representation has exactly 7 runs.at n=5A043615
• Number of square divisors of n!.at n=39A055993
• Number of square divisors of n!.at n=40A055993
• Numbers whose square has more than 2/3 of its digits the same.at n=29A060813
• a(1) = 2, a(n+1) > a(n) is the smallest multiple of a(n) using only even digits.at n=10A078222
• Numbers n in which the last K digits of n form an integer divisible by K^3, for K = 1, 2, ..., M, where M is the number of digits in n.at n=42A079239
• Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).at n=39A132633
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 8.at n=34A136885
• a(n) = Sum_{d|n} Moebius(n/d)*d^(b-1)/phi(n) for b = 5.at n=27A160891
• Totally multiplicative sequence with a(p) = 10*(p+1) for prime p.at n=17A166650
• Numbers k such that tau(phi(k)) = rad(k).at n=18A173618
• Principal diagonal of the convolution array A212891.at n=14A213436
• 4-level binary fanout graph coloring a rectangular array: number of n X 1 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=10A223442
• Number of pairs (x, y) with 0 <= x, y <= n such that the distance between two points is a positive integer.at n=30A228108
• Numbers m such that, in the prime factorization of m, the product of the exponents equals the sum of prime factors and exponents.at n=14A231231