1000010

Appears in sequences

• Numbers written in base of triangular numbers.at n=30A000462
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=15A007924
• Liponombres: numbers whose French name does not contain the letter "e".at n=18A014254
• 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=23A014417
• Sums of 2 distinct powers of 10.at n=16A038444
• When cubed gives number composed just of the digits 0, 1, 2, 3.at n=25A043681
• Sums of two powers of 10.at n=22A052216
• A064413(n) written in base of primes, read from right to left, written as a string.at n=33A064743
• a(n) = A036229(n) - 111...1 (with n 1's).at n=14A068086
• Multiples of 2 whose digit sum is 2.at n=16A069537
• Suburban numbers: without b, r, s or u.at n=41A072955
• a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=11A077712
• Numbers in binary representation with odd length.at n=24A079112
• 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=16A086067
• a(n) = 66 written in base n.at n=1A095524
• a(n) = 66 written in base 13 - n.at n=11A095525
• Numbers n such that Sum_of_Digits modulo n <= 2.at n=36A101318
• 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=20A105424
• Numbers n such that sum of digits of n^3 is 2^3 = 8.at n=34A107679
• Sequence A115793 in binary.at n=22A115794