102000

Appears in sequences

• Cubes written in base 5.at n=14A004635
• a(1) = 1, a(n) is the smallest multiple of n which begins with a(n-1) and is greater than a(n-1).at n=5A078282
• Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n.at n=16A090058
• a(n) = binomial(n+2,3)*5^3.at n=15A141480
• a(n+1) is the least integer > a(n) containing all digits of a(n); a(1)=2.at n=24A155890
• G.f.: A(q) = exp( Sum_{n>=1} A162552(n) * 3*A038500(n) * q^n/n ).at n=34A161808
• Least numbers whose groups of 2,3,...,n digits taken from the left are divisible by 2,3,...,n.at n=5A214437
• The smallest n-digit number whose last k digits are divisible by k for k = 1..n.at n=5A220491
• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A235252
• Number of (n+1) X (5+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A235255
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=16A235258
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 7, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=19A235258
• Numbers n such that n is the average of four consecutive primes n-13, n-1, n+1 and n+13.at n=15A260959
• Numbers k such that 8*10^k + 51 is prime.at n=28A287296
• Polydivisible nonnegative integers whose decimal digits span an initial interval of {0,...,9}.at n=13A305712
• Numbers whose number of distinct prime factors is greater than the sum of their digits.at n=37A327786
• a(n) = a(n-1) concatenated with the smallest number k, such that a(n) is divisible by lcm(1..n).at n=5A336401
• a(n) is the least x such that x-1 and x+1 are prime and there are exactly n primes of the form x-1+t or x+1+t where t divides x.at n=38A340170
• a(n) is the least number k such that A018804(k)/k = n.at n=32A353264
• a(n) is the least positive integer k such that prime(n) + k divides the concatenation of prime(n) - 1 and prime(n).at n=26A385172