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 A083701 #21 Nov 01 2018 12:25:02
%S A083701 2,2,3,7,23,0,457,409,48889,459841,6366361
%N A083701 Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists.
%C A083701 Next term >= 276000000. - _Robert G. Wilson v_, May 12 2003
%F A083701 a(n) = A023048(A000045(n)). - _Jianing Song_, Oct 31 2018
%e A083701 a(8) = 409 because 409 is the first prime having Fibonacci(8) = 21 as least primitive root
%t A083701 << NumberTheory`NumberTheoryFunctions`; a = Table[ Fibonacci[i], {i, 2, 20}]; b = Table[0, {20}]; k = 1; Do[k = NextPrime[k]; j = FromDigits[ Flatten[ Position[ a, PrimitiveRoot[k]]]]; If[ b[[j]] == 0, b[[j]] = k], {n, 1, 10^6}]; b
%Y A083701 Cf. A023048, A083702.
%K A083701 nonn,more
%O A083701 1,1
%A A083701 _Sven Simon_, May 04 2003
%E A083701 Offset 1 from _Michel Marcus_, Oct 30 2018