6400000

Appears in sequences

• Numbers of form 8^i*10^j, with i, j >= 0.at n=33A025634
• a(1) = 8; for n > 1, a(n+1) = a(n) * sum of digits of a(n).at n=6A047900
• Numbers whose product of distinct prime factors is equal to its sum of digits.at n=33A067077
• a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).at n=16A079838
• 10th binomial transform of (1,9,0,0,0,0,0,...).at n=6A081045
• Numbers k such that k and k^2 use only the digits 0, 4, 5, 6 and 9.at n=6A136950
• Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 9.at n=43A136955
• Numbers k such that k and k^2 use only the digits 0, 4, 6 and 9.at n=6A136957
• a(n) = n^5*H(n) where H() is the Hurwitz class number.at n=20A297122
• Numbers k such that the sum of the distinct digits of k is equal to the product of the prime divisors of k.at n=32A357263
• Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n.at n=24A380336
• a(n) = 2 * (3*n+2)^(n-1).at n=6A385085