101010

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=20A014417
• Theta series of A*_14 lattice.at n=40A023926
• Positive numbers having the same set of digits in base 2 and base 10.at n=37A037415
• Numbers k such that k is a substring of its base-2 representation.at n=25A038102
• Sums of 3 distinct powers of 10.at n=14A038445
• Numbers whose base-10 representation has exactly 6 runs.at n=0A043642
• Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=40A055481
• Alternate digits 1 and 0.at n=6A056830
• 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=7A062033
• Dyck language interpreted as binary numbers in ascending order.at n=4A063171
• Positions of negative coefficients in cyclotomic polynomial Phi_n(x), A063698 in binary.at n=14A063699
• Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=7A064841
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=39A066327
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=39A066330
• Binary expansion of n followed by its reverse complement.at n=4A066489
• Products of exactly 6 distinct primes.at n=20A067885
• a(n) = A036229(n) - 111...1 (with n 1's).at n=19A068086
• a(n) = A036229(n) - 111...1 (with n 1's).at n=31A068086
• a(1) = 1; a(n+1) is the smallest number > a(n) which differs from it at every digit.at n=45A068860
• Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k).at n=25A069522