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.
%I A241604 #16 Aug 05 2019 03:02:53
%S A241604 0,0,2,3,2,2,3,2,5,2,3,2,3,2,5,2,2,2,2,13,5,3,2,3,5,2,3,2,2,3,3,2,3,2,
%T A241604 2,3,2,2,5,2,2,2,21,5,2,3,2,3,2,2,3,13,13,2,3,5,2,3,2,3,2,2,2,34,5,2,
%U A241604 2,5,2,2,3,13,3,2,2,5,2,2,3,13
%N A241604 Least Fibonacci number smaller than prime(n)/2 which is a quadratic nonresidue modulo prime(n), or 0 if such a Fibonacci number does not exist.
%C A241604 According to the conjecture in A241568, a(n) should be positive for all n > 2.
%H A241604 Zhi-Wei Sun, <a href="/A241604/b241604.txt">Table of n, a(n) for n = 1..10000</a>
%H A241604 Z.-W. Sun, <a href="http://arxiv.org/abs/1405.0290">New observations on primitive roots modulo primes</a>, arXiv preprint arXiv:1405.0290 [math.NT], 2014.
%e A241604 a(4) = 3 since the Fibonacci number F(4) = 3 < prime(4)/2 is a quadratic nonresidue modulo prime(4) = 7, but the Fibonacci numbers F(1) = F(2) = 1 and F(3) = 2 are quadratic residues modulo prime(4) = 7.
%t A241604 f[k_]:=Fibonacci[k]
%t A241604 Do[Do[If[f[k]>Prime[n]/2,Goto[bb]];If[JacobiSymbol[f[k],Prime[n]]==-1,Print[n," ",Fibonacci[k]];Goto[aa]];Continue,{k,1,(Prime[n]+1)/2}];Label[bb];Print[n," ",0];Label[aa];Continue,{n,1,80}]
%Y A241604 Cf. A000040, A000045, A241568.
%K A241604 nonn
%O A241604 1,3
%A A241604 _Zhi-Wei Sun_, Apr 26 2014