800000

Appears in sequences

• Powers of 2 written in base 16.at n=23A004655
• a(n) = Product_{i=0..8} floor((n+i)/9).at n=41A009714
• Numbers of form 8^i*10^j, with i, j >= 0.at n=26A025634
• a(n) = n*20^(n-1).at n=4A061650
• a(n) is smallest number >= a(n-1) such that a(n) plus any set of the previous values of the sequence is a nonsquare; starting with a(1) = 2.at n=25A064776
• Number of minimal monic annihilator polynomials over the ring of integers modulo n.at n=48A069098
• Numbers k such that Sum_i ( e(i)/p(i) ) is an integer, where the prime factorization of k is Product_i ( p(i)^e(i) ).at n=34A072873
• Multiples of 5 in which there is no common digit in successive terms.at n=39A083493
• a(n) = n^n * (n+1)^(n+1).at n=4A090205
• Square pyramorphic numbers: integers m such that the sum of the first m squares (A000330) ends in m.at n=41A093534
• a(n)=Product{k=0..n, 1+9^A010060(k)}/2.at n=8A101655
• Take the n-th pair of consecutive digits of the sequence and form their absolute difference; the result is the n-th digit of the sequence; a(n) < a(n+1).at n=23A102694
• Denominators of coefficients that satisfy: 4^n = Sum_{k=0..n} c(k)*x^k for n>=0, where c(k) = A107051(k)/a(k).at n=5A107052
• Numbers n such that every digit of both n and n^2 contains a loop (only digits 0,4,6,8,9 in n and n^2).at n=39A107626
• Numbers n such that sum of digits of n^3 is 2^3 = 8.at n=32A107679
• Powerful(1) numbers (A001694) whose digit reversal is a cube.at n=18A115693
• Coefficients of Zeta(2*n+1) in a certain integer relation involving Ramanujan exponential-type sums.at n=3A119544
• a(n) = if n mod 2 = 1 then (n^2-1)*n^3/4 else n^5/4.at n=20A122657
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 8.at n=27A136931
• Numbers k such that k and k^2 use only the digits 0, 4, 5, 6 and 8.at n=7A136949