1000101

Appears in sequences

• Numbers written in base of triangular numbers.at n=34A000462
• 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=25A014417
• Roots of 'non-palindromic cubes remaining cubic when written backwards'.at n=13A035125
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=32A038114
• Lexicographically earliest strictly increasing base 6 autovarious sequence: a(n) = number of distinct a(k) mod 6^n (written in base 6).at n=26A038115
• Sums of 3 distinct powers of 10.at n=21A038445
• Numbers k such that k^2 contains only digits {0,1,2}, not ending with zero.at n=19A058411
• Carryless binary square of n; also Moser-de Bruijn sequence written in binary.at n=11A063010
• Numbers in binary representation with odd length.at n=27A079112
• Sequence A084451 in binary.at n=22A084450
• Sequence A084457 in binary.at n=16A084456
• Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10.at n=27A085315
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=17A086818
• a(n) = 69 written in base n.at n=1A095530
• a(n) = 69 written in base 13 - n.at n=11A095531
• Modular binomial transform of 10^n.at n=13A101623
• 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=22A105424
• Semiprimes consisting of digits 0 and 1 only.at n=17A105991
• Sequence A115793 in binary.at n=24A115794
• Sequence A115819 in binary.at n=9A115820