88335

Appears in sequences

• a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}.at n=25A024202
• Triangle read by rows: T(n,k) is the number of permutations of [n] that have k isolated entries (0 <= k <= n).at n=59A180196
• a(0)=1, a(1)=2; thereafter a(n) = f(n-1) + f(n-2) where f() = A164387().at n=19A185265
• Numbers n such that n^3 +/- 2 and 3*n +/- 2 are all prime.at n=7A268475
• 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=6A354194