909090909

Appears in sequences

• a(n) = 9*a(n-1) + 10*a(n-2).at n=10A015585
• a(n) = floor(10^(n-1)/n).at n=10A056159
• a(n) = floor(10^10/n).at n=10A057072
• a(n) = (n^n-(-1)^n)/(n+1).at n=10A081216
• Least integer multiple of f(1/n) where f(1/n) is the number obtained by retaining only n digits after decimal and deleting the rest.at n=10A095199
• Least integer multiple of 1/n, truncated to n digits after decimal.at n=10A111690
• Numbers n such that the decimal digits of n are not present in k*n, k=2..9.at n=27A175637
• Numbers with the property that all pairs of consecutive digits differ by 9.at n=16A198486
• a(n) = floor(n^n / (n+1)).at n=10A215159
• Ben Ames Williams's Monkey and Coconuts Problem.at n=10A276135
• Numbers whose reciprocals have period 10.at n=29A345319
• Positive integers n (with k digits) such that if a positive integer m with k+1 digits is divisible by n, then all the rotations of m are divisible by n.at n=30A360423
• Kaprekar numbers according to the definition in A006886 that are not in A053816.at n=9A382160
• Palindromic Kaprekar numbers.at n=14A382163
• Palindromic Kaprekar numbers that are not repdigit Kaprekar numbers.at n=0A382164