333333

Appears in sequences

• a(n) = 3*(10^n - 1)/9.at n=6A002277
• Repdigit numbers, or numbers whose digits are all equal.at n=48A010785
• Numbers > 9 with all digits the same.at n=38A014181
• Palindromic in bases 10 and 16.at n=23A029731
• Palindromic quotients (k*(k+1)*(k+2)) / (k+(k+1)+(k+2)).at n=11A032790
• a(n) = floor(10^6/n).at n=2A033426
• Numbers that are divisible by all of their 1 and 2 digit substrings.at n=45A063527
• Geometric mean of digits = 3 and digits are in nondecreasing order.at n=14A069516
• Numbers m that divide the concatenation of m-1 and m+1.at n=12A069871
• Repdigits (A010785), excluding repunits (A002275), ordered by product of digits (A007954).at n=34A070841
• Triplets: base 10 representation is the juxtaposition of three identical strings.at n=32A074842
• Final terms of rows of A077529.at n=38A077530
• Nonsquarefree numbers obtained by repeating a single digit.at n=17A077572
• Numbers with a digit sum of n and a maximum product of digits. In case of two identical products choose the largest number.at n=17A083178
• a(n) = A084006(n)^(1/2).at n=14A084007
• A coding semi-palindromic sequence made by converting a zero containing limited digit set palindromic sequence to a fraction and then converting back to an continued fraction array and making the sequence up from the result.at n=5A089184
• Smallest number using a single digit with multiplicity such that every partial concatenation is prime.at n=7A089335
• Least number with identical digits such that the concatenation a(n) a(n-1) ...a(2)a(1) a(2) ... a(n-1) a(n) is a prime.at n=14A090276
• a(n) = 0^n + ((n-9)/9)*(1-10^n).at n=6A091686
• Integer part of the square root of n-th decimal repunit.at n=11A096483