1111111111

Appears in sequences

• Unary representation of natural numbers.at n=9A000042
• Repunits: (10^n - 1)/9. Often denoted by R_n.at n=10A002275
• Least positive multiple of n written in base 6 using only 0 and 1.at n=34A004286
• a(n) = 10 in base 10-n.at n=9A008707
• a(n) = n^0 + n^1 + ... + n^(n-1), or a(n) = (n^n-1)/(n-1) with a(0)=0; a(1)=1.at n=10A023037
• Sums of 10 distinct powers of 10.at n=0A038452
• k th digit of a(n) is the number of different digits within 1 of k (not including k).at n=10A039988
• a(n) = floor(10^10/n).at n=8A057072
• Digital representation of n contains only 1's and 0's, is palindromic and contains no singleton 1's or 0's.at n=18A061851
• Square array read by antidiagonals of n written in base k (n,k>0).at n=54A063431
• Triangle read by rows in which k-th entry in row n is representation of n in base k, for 1 <= k <= n.at n=45A063432
• Integer parts of the square roots of the schizophrenic numbers (A014824).at n=18A068995
• a(1) = 1; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.at n=11A069505
• a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.at n=10A069506
• a(1) = 4; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.at n=10A069507
• a(1) = 6; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.at n=9A069508
• a(1) = 1; a(n) = smallest palindrome of the form k*a(n-1) + 1.at n=17A069510
• Numbers m that divide the concatenation of m-1 and m+1.at n=19A069871
• Repdigits (A010785) ordered by sum of digits (A007953).at n=26A070840
• Sum_{k=1..n, gcd(n,k) = 1} 10^(k-1).at n=9A073030