1001010

Appears in sequences

• Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added.at n=28A014417
• q-Fibonacci numbers for q=10, scaling a(n-1).at n=4A015482
• Sums of 3 distinct powers of 10.at n=24A038445
• In the list of divisors of n (in binary), each digit 0-1 appears equally often.at n=7A045799
• Sequence A084457 in binary.at n=10A084456
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=20A086818
• a(n) = 74 written in base n.at n=1A095540
• a(n) = 74 written in base 14 - n.at n=12A095541
• The part of n in base phi left of the decimal point, using a greedy algorithm representation (more precisely, using the Bergman-canonical representation).at n=24A105424
• Sequence A115799 in binary.at n=8A115800
• Sequence A115819 in binary.at n=10A115820
• Concatenation for i=1 to n of A005171(i); also A118255 in base 2.at n=6A118256
• Members of A016052 whose digit sum is three.at n=26A119507
• Semiprimes written in base 2.at n=24A122466
• 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=23A130310
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 6.at n=44A136827
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 7.at n=44A136831
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 7 and 8.at n=46A136832
• Numbers that show the distribution of prime numbers up to the n-th prime using "0" for primes and "1" for nonprime numbers.at n=3A139103
• Bisection of A139103.at n=1A139110