177199
domain: N
Appears in sequences
- a(n) = Fibonacci(n)*a(n-1) + 1, a(0) = 0.at n=8A176343
- Numbers n such that A045876(n) = A045876(n+1).at n=33A276758
- Numbers k for which phi(A267099(k)) is equal to phi(k), but the number of 4m+1 and 4m+3 primes in the prime factorization of k (when counted with multiplicity) is not equal. Here A267099 is fully multiplicative involution swapping the positions of 4m+1 and 4m+3 primes, and phi is Euler totient function.at n=18A354194