1001000

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=26A014417
• Sums of 2 distinct powers of 10.at n=18A038444
• When cubed gives number composed just of the digits 0, 1, 2, 3.at n=27A043681
• Smallest oblong (promic) number containing exactly n 0's.at n=4A048530
• Sums of two powers of 10.at n=24A052216
• a(n) is the unique k such that palindrome A068065(n) = k + reverse(k).at n=18A068910
• Multiples of 2 whose digit sum is 2.at n=18A069537
• Define a mapping for a reduced rational number p/q by f(p/q) = 1 followed by p zeros followed by a 1 followed by q zeros.at n=3A076940
• Numbers in binary representation with odd length.at n=30A079112
• a(n) = 72 written in base n.at n=1A095536
• a(n) = 72 written in base 14 - n.at n=12A095537
• Number of permutations of [n] with exactly 3 descents which avoid the pattern 4321.at n=6A095889
• Numbers n such that Sum_of_Digits modulo n <= 2.at n=38A101318
• 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=23A105424
• Numbers n such that sum of digits of n^3 is 2^3 = 8.at n=36A107679
• Sequence A114386 in binary.at n=8A114387
• Sequence A115813 in binary.at n=20A115814
• Numbers k such that the decimal representation of k is contained as substring in that of the k-th triangular number.at n=29A119238
• 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=22A130310
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 6.at n=43A136827