268801

Appears in sequences

• Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=13A091982
• Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=25A094401
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=30A212424
• Composite squarefree numbers k such that p+1 divides k-1 for any prime p dividing k.at n=19A225711
• Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=22A319168
• Numbers k such that omega(k) = 4 and p^omega(k) < k^(1/4) < lpf(k)^(omega(k)+1) for all primes p | k such that p > lpf(k), where lpf = A020639(k).at n=1A383178
• Smallest number k with n distinct prime factors such that A010846(k) = A024718(n) (a tight lower bound), or -1 if such k does not exist.at n=4A384000