1111111110

Appears in sequences

• Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=17A004290
• Sums of 9 distinct powers of 10.at n=9A038451
• Least multiple of n consisting of a succession of 1's followed by a succession of 0's.at n=8A052983
• Least multiple of n consisting of a succession of 1's followed by a succession of 0's.at n=17A052983
• Sum of the forward and reverse concatenations of 1 to n.at n=8A078262
• Expansion of x(1+10x)/((1-x^2)(1-10x^2)).at n=18A094026
• Numbers k such that k is a term of A014778, but k-1 and k+1 are not.at n=3A094801
• a(0)=0; a(n) = 10*a(n-1) + 10.at n=9A105279
• Sequence A115809 in binary.at n=20A115810
• a(n) = Sum_{k=1..A124259(n)} n^k.at n=9A124260
• A shell geometric model of the nucleus. The location of the magic numbers. A triangle.at n=10A130598
• a(n) = 111111111 * n.at n=9A172525
• Base-10 lunar factorials: a(n) = (lunar) Product_{i=1..n} i.at n=18A189788
• a(n) = (n^n - n)/(n - 1).at n=8A226238
• a(n) = Sum_{k=1..9} n^k.at n=10A228293
• Least positive multiple of n which when written in base 10 is either a repunit or of the form 111...000.at n=18A244859
• Erroneous version of A004290.at n=17A257344
• Record values in A004290.at n=5A268609
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 261", based on the 5-celled von Neumann neighborhood.at n=9A280410
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 413", based on the 5-celled von Neumann neighborhood.at n=9A282002