400000

Appears in sequences

• Powers of 2 written in base 8.at n=17A004647
• Powers of 2 written in base 16.at n=22A004655
• Numbers of form 4^i*10^j, with i, j >= 0.at n=33A025621
• a(n)/100000 gives sqrt(n) to 5 places after the decimal point.at n=15A027663
• 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=46A030283
• a(n) = floor(10^7/n).at n=24A033425
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*10^j.at n=19A038288
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*8^j.at n=16A038310
• Triangle read by rows: T(j,k) is the number of acyclic functions from {1,...,j} to {1,...,k}. For n >= 1, a(n) = (k-j)*k^(j-1), where k is such that C(k,2) < n <= C(k+1,2) and j = (n-1) mod C(k,2). Alternatively, table T(k,j) read by antidiagonals with k >= 1, 0 <= j <= k: T(k,j) = number of acyclic-function digraphs on k vertices with j vertices of outdegree 1 and (k-j) vertices of outdegree 0; T(k,j) = (k-j)*k^(j-1).at n=51A058127
• Multiples of 5 in which there is no common digit in successive terms.at n=35A083493
• Third binomial transform of Fib(3n-3) divided by 2.at n=8A093133
• Expansion of (1-6*x)/(1-10*x).at n=6A093141
• Square pyramorphic numbers: integers m such that the sum of the first m squares (A000330) ends in m.at n=37A093534
• Erroneous version of A052218.at n=10A094628
• Expansion of (1+4x-6x^2-36x^3)/(1-19x^2+90x^4).at n=11A097112
• Lexicographically earliest increasing sequence of composite numbers such that the digits of a(n) do not appear in a(n-1).at n=40A100373
• n*phi(n)*phi(phi(n)) is a fourth power.at n=9A116003
• Smallest number expressible using the next Roman-numeral symbol under the vinculum system.at n=11A118639
• Numbers k such that the k-th triangular number contains only digits {0,2,8}.at n=10A119056
• a(3n)=10^n. a(3n+1)=4*10^n. a(3n+2)=7*10^n.at n=16A135262