|
|
A094395
|
|
Odd composite n such that n divides Fibonacci(n) + 1.
|
|
12
|
|
|
5777, 10877, 17261, 75077, 80189, 100127, 113573, 120581, 161027, 162133, 163059, 231703, 300847, 430127, 618449, 635627, 667589, 851927, 1033997, 1106327, 1256293, 1388903, 1697183, 1842581, 2263127, 2435423, 2512889, 2662277
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
For each prime p, Fibonacci(p) = 5^((p-1)/2) mod p, so p divides Fibonacci(p) + 1 for each prime p=10k+-3. Hence it is interesting to seek also nonprimes with the same property, a motivation for this sequence. - Robert FERREOL, Jul 14 2015
Are all terms squarefree? A counterexample can't be divisible by the square of a prime < 1000. - Robert Israel, Jul 17 2015
Any term that is not squarefree must be divisible by the square of a Fibonacci-Wieferich prime (see the StackExchange link). There are believed to be infinitely many such primes, but none are known, and none are less than 2*10^14. - Robert Israel, Jul 22 2015
|
|
LINKS
|
|
|
MAPLE
|
with(combinat):test:=n->(fibonacci(n)+1) mod n= 0:
select(test and not isprime , [seq(2*k+1, k=1..10000)]);
|
|
MATHEMATICA
|
Select[ Range[3, 300000, 2], !PrimeQ[ # ] && Mod[Fibonacci[ # ] + 1, # ] == 0 &]
|
|
PROG
|
(PARI) main(size)=my(v=vector(size), i, t=1); for(i=1, size, while(1, if(t%2==1&&omega(t)>1&&(fibonacci(t)+1)%t==0, v[i]=t; break, t++)); t++); v; \\ Anders Hellström, Jul 17 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|