login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094063 Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n). 5

%I #8 Dec 01 2019 07:15:18

%S 5777,10877,12958,17302,40948,41998,75077,88198,95038,100127,113573,

%T 130942,133742,156178,160378,161027,162133,163438,168838,203942,

%U 219742,231703,300847,314158,336598,390598,393118,430127,467038,480478,534508

%N Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).

%H Amiram Eldar, <a href="/A094063/b094063.txt">Table of n, a(n) for n = 1..235</a>

%t Select[ Range[ 2, 100000 ], ! PrimeQ[ # ] && Mod[ Fibonacci[ # ] - JacobiSymbol[ #, 5 ], # ] == 0 && JacobiSymbol[ #, 5 ] == -1 & ]

%Y Cf. A049062, A090820, A093372.

%K nonn

%O 1,1

%A _Eric Rowland_, Apr 29 2004

%E More terms from _Ryan Propper_, Nov 07 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 15:13 EDT 2024. Contains 372254 sequences. (Running on oeis4.)