109375

Appears in sequences

• Numbers of the form 5^i*7^j with i, j >= 0.at n=28A003595
• a(n) = 7*5^n.at n=6A005055
• Triangle of coefficients in expansion of (1+5x)^n.at n=34A013612
• a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026374.at n=12A026950
• Numbers whose prime factors are 5 and 7.at n=15A033851
• Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).at n=29A038243
• Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.at n=11A051346
• Duplicate of A051346.at n=11A051520
• a(n) = n*5^(n-1).at n=7A053464
• Trimorphic but not bimorphic nor automorphic.at n=38A056032
• Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n.at n=35A057253
• Lesser of two consecutive numbers each divisible by a fifth power.at n=30A068783
• Lesser of two consecutive numbers each divisible by a sixth power.at n=4A068784
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the size k of the subtree rooted at the vertex labeled by 1.at n=28A071209
• Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=26A076482
• 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=5A097219
• Multiply sequence A007775 (1 7 11 13 ...) by sequence A000351 (1 5 25 125 ...).at n=34A135766
• Terms in A178335 not divisible by 10.at n=19A158204
• a(n) = (2*n+1)*25^n.at n=3A166725
• Numbers n such that tau(phi(n)) = sigma(rad(n)).at n=31A173745