121422
domain: N
Appears in sequences
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).at n=22A023488
- Numbers n for which there exists k < n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=17A255335
- The least number k > A255334(n) for which A000203(k) = A000203(A255334(n)) and A007947(k) = A007947(A255334(n)), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=17A255423