106680

Appears in sequences

• Four-fold exponential convolution of Fibonacci numbers with themselves.at n=8A014340
• Smallest number having exactly n divisors that are not greater than the number's greatest prime factor.at n=26A087134
• Numbers that can be expressed as the difference of the squares of primes in exactly eight distinct ways.at n=20A092004
• a(n) = 441*n^2 - 394*n + 88.at n=15A157734
• Coefficient of x in the reduction of the polynomial (x+2)^n by x^3->x^2+x+1.at n=10A192802
• a(n) = binomial(2*n,n) + Sum_{k=1..n} binomial(2*n-k,n-k)*Fibonacci(k).at n=9A277287
• Starting at n, a(n) is the total number of moves made to the left according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away from zero instead.at n=39A324661
• Numbers k such that A380845(k)/k > A380845(m)/m for all m < k.at n=20A381070
• Smallest number whose largest odd noncomposite divisor is its n-th divisor.at n=26A384232