176175
domain: N
Appears in sequences
- a(n) is the smallest positive integer such that d(a(n))*d(a(n)+1) > d(a(n-1))*d(a(n-1)+1), where d(m) is the number of divisors of m and n > 1; a(1) = 1.at n=32A123000
- a(n) = (n-2)^4 - a(n-1) - a(n-2), with a(1) = a(2) = 0.at n=27A152729
- a(n) = (1/4)*F(n)^2 * L(n+1)^2 * F(n-1) * L(n+2), where F(n) and L(n) are the Fibonacci and Lucas numbers, respectively.at n=5A163195
- Sum of the cubes of the first n even-indexed Fibonacci numbers, minus 1.at n=5A163199
- Integers k such that k and k+1 are products of 8 primes.at n=3A268469
- Least number x such that x^n has n digits equal to k. Case k=5.at n=40A285452