OFFSET
1,1
COMMENTS
Pseudoprimes to a criterion for primality which tests that
2. 2^(k-1) == 1 (mod k) (see A001567).
All terms appear to be congruent to 1 or -1 (mod 5).
Terms that are not congruent to 1 or -1 (mod 5): 22711873, 40160737, 55462177, ... . - Amiram Eldar, Sep 12 2022
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..671 from Giovanni Resta)
EXAMPLE
6601 is in the sequence because the 6600th Fibonacci number is divisible by 6601 and 2^6600 = 1 mod 6601.
MAPLE
with(combinat):f:= n-> fibonacci(n): for n from 1 to 2000000 do if(f(n+1) mod n = 0 or f(n-1) mod n = 0) and 2^(n-1) mod n = 1 and not isprime(n) then print(n) fi od;
MATHEMATICA
Select[Range[1, 4*10^6, 2], CompositeQ[#] && PowerMod[2, # - 1, #] == 1 && (Divisible[Fibonacci[# - 1], #] || Divisible[Fibonacci[# + 1], #]) &] (* Amiram Eldar, Sep 12 2022 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Gary Detlefs, Jul 17 2012
STATUS
approved