300000

Appears in sequences

• Number of invertible 2 X 2 matrices mod n.at n=24A000252
• Powers of 3 written in base 9.at n=11A004663
• Powers of 3 written in base 27.at n=16A004669
• Numbers k such that k^2 contains exactly 2 distinct digits.at n=35A016069
• a(n)/100000 gives sqrt(n) to 5 places after the decimal point.at n=8A027663
• Numbers k such that k^2+k+9 is a palindrome.at n=29A027726
• a(n) is root of square starting with digit 9: first term of runs.at n=8A035076
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*10^j.at n=19A038264
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*6^j.at n=16A038308
• Expansion of e.g.f. (1-x)/(1-5*x).at n=5A052675
• For n>3: a(n) is a multiple of three distinct earlier terms.at n=32A060301
• Smallest multiple of n using only digits 0 and 3.at n=31A078242
• Multiples of 2 in which there is no common digit in successive terms.at n=38A083490
• Multiples of 4 in which there is no common digit in successive terms.at n=36A083492
• Multiples of 8 in which there is no common digit in successive terms.at n=31A083496
• Expansion of (1-7x)/(1-10x).at n=6A093138
• a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that last digit of a(n-1) + first digit of a(n) = 3.at n=15A098408
• Length of the cycle for Lucas numbers mod 10^n.at n=5A114307
• Members of A016052 whose digit sum is three.at n=23A119507
• a(n) is the minimal difference between two distinct n-digit numbers with property that when one of them is typed into a calculator and rotated 180 degrees, the other one is seen.at n=10A125521