11111111

Appears in sequences

• Unary representation of natural numbers.at n=7A000042
• 8 in base 10-n.at n=9A001732
• Repunits: (10^n - 1)/9. Often denoted by R_n.at n=8A002275
• Least positive multiple of n written in base 5 using only 0 and 1.at n=23A004285
• Least positive multiple of n written in base 9 using only 0 and 1.at n=7A004289
• Rows of Sierpiński's triangle (Pascal's triangle mod 2).at n=7A006943
• Numbers k such that both k and the k-th triangular number are palindromes.at n=10A008510
• a(n) = floor(10^8/n).at n=8A033424
• Reverse and add (in binary).at n=10A035526
• Fibonacci numbers in base 1.at n=4A037842
• Sums of 8 distinct powers of 10.at n=0A038450
• k th digit of a(n) is the number of different digits within 1 of k (not including k).at n=8A039988
• k th digit of a(n) is the number of different digits within 4 of k (not including k).at n=31A039990
• a(n)^2 is a square whose consecutive digits differ by 1.at n=11A048412
• a(n) = n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.at n=10A053717
• a(n) = floor(10^(n-1)/n).at n=8A056159
• Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=30A057148
• a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 2.at n=15A061512
• a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 5.at n=6A061519
• Digital representation of n contains only 1's and 0's, is palindromic and contains no singleton 1's or 0's.at n=10A061851