171875

Appears in sequences

• Expansion of bracket function.at n=17A000750
• Numbers of the form 5^i * 11^j.at n=26A003598
• Numbers k that divide s(k), where s(1)=1, s(j)=11*s(j-1)+j.at n=17A014858
• Numbers k that divide the (right) concatenation of all numbers <= k written in base 5 (most significant digit on left).at n=33A029450
• Scaled Chebyshev U-polynomial evaluated at sqrt(5)/2.at n=9A030191
• Numbers k that divide 3^k + 2^k.at n=25A045576
• Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.at n=33A056739
• Binomial transform of Fibonacci(2n).at n=10A093131
• 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=8A097219
• Multiply sequence A007775 (1 7 11 13 ...) by sequence A000351 (1 5 25 125 ...).at n=42A135766
• a(0)=1; a(1)=5; a(2)=11; a(n)=a(1)*a(n-1).at n=8A141496
• A triangular sequence of coefficients based on a skip prime prime power sequence: t(n,m)=Prime[m + 1]^n*Prime[m + 3]; qualified so the m=0 and n=0 terms are well-defined.at n=23A141500
• Numbers which can be expressed as the product of numbers made of only fives.at n=27A161143
• a(n) = (n/4)*5^(n/2)*((1+sqrt(5))^2+(-1)^n*(1-sqrt(5))^2).at n=11A187275
• Power floor-ceiling sequence of sqrt(5).at n=14A215091
• a(n) = Sum_{k = 1..2*n} binomial(2*n,k) * Fibonacci(2*k).at n=5A219462
• Maximum of the partition function on the set of all partitions of n.at n=29A239054
• Numbers k such that phi(k) - k = phi(k') - k', where k' is the arithmetic derivative of k and phi(k) is the Euler totient function.at n=19A239940
• a(n) = Sum_{k>=0} (-1)^k*binomial(n, 5*k+2).at n=21A289387
• a(n) = Sum_{k>=0} (-1)^k*binomial(n,5*k+3).at n=22A289388