187500

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*10^j.at n=22A038252
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*5^j.at n=26A038307
• a(n) = det(M(n)) where M(n) is the n X n matrix defined by m(i,i)=6, m(i,j)=i/j.at n=6A079027
• 5th binomial transform of (1,1,0,0,0,0,.....).at n=7A081105
• a(n) = n^2*binomial(n,2).at n=24A092364
• Numbers n that are the hypotenuse of exactly 6 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 6 ways.at n=9A097219
• Numbers n such that the period length P(n) of the Fibonacci sequence mod n is a multiple of n.at n=40A105953
• Numbers of the form (5^i)*(12^j), with i, j >= 0.at n=24A108201
• The n-th arithmetic derivative of 5^6.at n=5A129152
• Numbers k such that tau(phi(k)) = rad(k).at n=25A173618
• Rectangular array T(n,k) = binomial(n,2)*k*n^(k-1) read by antidiagonals.at n=39A178756
• Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=74A184633
• Number of nX3 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or two horizontal or vertical neighbors.at n=9A199241
• a(n) = 12*5^n.at n=6A216491
• 3 X 3 X 3 triangular graph without horizontal edges coloring a rectangular array: number of n X 1 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=13A223346
• Integer areas of integer-sided triangles where two sides are of square length.at n=36A232461
• Numbers k whose smallest multiple that is a Fibonacci number is Fibonacci(k).at n=14A289586
• Integers equal to the least common multiple of the set of numbers generated by all the differences between their consecutive divisors, taken in increasing order.at n=18A298045
• Numbers m such that the smallest digit in the decimal expansion of 1/m is 3, ignoring leading and trailing 0's.at n=38A352157
• a(1) = 2; a(n) - a(n-1) = A093803(a(n-1)), the largest odd proper divisor of a(n-1).at n=42A358033