cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A094063 #8 Dec 01 2019 07:15:18
%S A094063 5777,10877,12958,17302,40948,41998,75077,88198,95038,100127,113573,
%T A094063 130942,133742,156178,160378,161027,162133,163438,168838,203942,
%U A094063 219742,231703,300847,314158,336598,390598,393118,430127,467038,480478,534508
%N A094063 Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).
%H A094063 Amiram Eldar, <a href="/A094063/b094063.txt">Table of n, a(n) for n = 1..235</a>
%t A094063 Select[ Range[ 2, 100000 ], ! PrimeQ[ # ] && Mod[ Fibonacci[ # ] - JacobiSymbol[ #, 5 ], # ] == 0 && JacobiSymbol[ #, 5 ] == -1 & ]
%Y A094063 Cf. A049062, A090820, A093372.
%K A094063 nonn
%O A094063 1,1
%A A094063 _Eric Rowland_, Apr 29 2004
%E A094063 More terms from _Ryan Propper_, Nov 07 2006