60000

Appears in sequences

• Numbers k such that the decimal expansion of k^2 contains k as a substring.at n=30A018834
• Numbers of form 6^i*10^j with i, j >= 0.at n=20A025629
• Substring of both its square and its cube.at n=28A029943
• a(0) = 0; for n>0, a(n) is the smallest number greater than a(n-1) which does not use any digit used by a(n-1).at n=40A030283
• Numbers that contain only one nonzero digit.at n=41A037124
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*10^j.at n=12A038312
• Numbers having four 0's in base 10.at n=5A043492
• Internal digits of n^2 include digits of n as substring.at n=17A046836
• Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.at n=40A054411
• Numbers n such that Sum_{k=1..n} d(k) is an integer where d(k) is the decimal fraction 0.k (e.g. d(999)=0.999).at n=8A054464
• Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.at n=22A057096
• Numbers whose square has more than 2/3 of its digits the same.at n=37A060813
• Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.at n=32A064484
• a(n) = phi(Fibonacci(n)).at n=25A065449
• Triangle with columns built from certain power sequences.at n=49A067410
• Smallest multiple of n using only digits 0 and 6.at n=31A078245
• 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=45A079239
• Multiples of 5 in which there is no common digit in successive terms.at n=29A083493
• Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real singular n X n (0,1)-matrix takes the value k, for n >= 2, 0 <= k <= n!.at n=57A089481
• a(n) = (3*10^n + 2*0^n)/5.at n=5A090019