10000010

Appears in sequences

• Sums of 2 distinct powers of 10.at n=22A038444
• When cubed gives number composed just of the digits 0, 1, 2, 3.at n=33A043681
• Sums of two powers of 10.at n=29A052216
• Binary expansion of n does not contain 1-bits at even positions. Integers whose base 4 representation consists of only 0's and 2s.at n=9A062033
• A064413(n) written in base of primes, read from right to left, written as a string.at n=37A064743
• Multiples of 2 whose digit sum is 2.at n=22A069537
• a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=13A077712
• Bit string encoding occurrence of digits of n in decimal representation: d-th bit is set iff d occurs in (n)10, 0 <= d < 10.at n=17A086067
• Inverse Moebius transform of powers of 10.at n=7A113705
• Sequence A115795 in binary.at n=22A115796
• Sequence A115797 in binary.at n=29A115798
• Sequence A115813 in binary.at n=27A115814
• Sequence A115831 in binary.at n=18A115832
• Minimal (or "greedy") Lucas representation of n, in which L(0) = 2 and L(2) = 3 are not allowed in the same representation (hence the correct representation of the integer 5 is 1010 rather than 101). A binary system of integers with Lucas numbers (A000032) as a base.at n=30A130310
• Numbers k such that there are 15 digits in k^2 and for each factor f of 15 (1,3,5) the sum of digit groupings of size f is a square.at n=6A153751
• Even numbers n (written in binary) such that in base-2 lunar arithmetic, the sum of the divisors of n is a number containing a 0 (in binary).at n=13A190149
• a(n) = n^7 + n.at n=10A190578
• a(n) is a binary vector for selecting distinct terms from A000124 that when summed give n; it uses the greedy algorithm.at n=31A204009
• NegaFibonacci representation for -n.at n=22A215023
• Numbers that when raised to the fourth power and written backwards give squares.at n=31A234472