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 A051830 #21 Feb 05 2025 22:01:10
%S A051830 0,0,3,0,1,0,0,1,0,1,1,0,1,0,0,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0,1,0,1,
%T A051830 1,1,0,0,0,0,1,1,1,0,0,1,1,0,0,1,0,1,1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,0,
%U A051830 0,1,0,1,0,0,1,0,1,0,1,1,1,1,1,0,1,0,1,0,1,0,0,1,0,1,1,0,1,1,0,1,0,0,0,1,1
%N A051830 a(n) = Fibonacci(p(n)+1) mod p(n), where p(n) is the n-th prime.
%C A051830 Terms are 1 when p(n) == 1 or 4 (mod 5) and 0 when p(n) == 2 or 3 (mod 5).
%F A051830 a(n) = max(0, Legendre(5,prime(n))) for n >= 4, where Legendre is the Legendre symbol. - _Haifeng Xu_, Jan 31 2025
%e A051830 p(3) = 5, so a(3) = Fibonacci(5+1) mod 5 = 3.
%t A051830 Table[Mod[Fibonacci[n+1],n],{n,Prime[Range[110]]}] (* _Harvey P. Dale_, Nov 27 2015 *)
%Y A051830 Cf. A000040, A000045, A003631, A045468, A051834, A051831.
%K A051830 nonn
%O A051830 1,3
%A A051830 _Jud McCranie_, Dec 11 1999