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 A366951 #38 Dec 21 2023 15:12:02
%S A366951 2,1,0,1,2,1,1,2,1,4,2,1,2,1,3,1,2,2,1,2,1,2,1,4,1,4,1,3,2,3,1,2,1,6,
%T A366951 2,6,1,1,1,1,2,4,2,1,1,18,10,1,1,4,9,2,2,2,1,3,2,2,1,10,1,1,7,2,1,1,6,
%U A366951 1,3,4,3,2,1,1,2,1,2,1,4,2,2,10,2,1,2,1
%N A366951 a(n) = 2*(p_n - 1)/A060305(n) iff p_n == +/- 1 (mod 5), 2*(p_n + 1)/A060305(n) iff p_n == +/- 2 (mod 5), 0 iff p_n = 5.
%F A366951 a(n) == 0 (mod 2) for prime(n) == +/- 1 (mod 5) and n > 2.
%F A366951 a(n) == 1 (mod 2) for Prime(n) == +/- 2 (mod 5) and n > 2.
%F A366951 a(n) = 1 iff prime(n) in A071774.
%F A366951 a(n) = 2 iff prime(n) in ({2} union A003147)/{5}.
%F A366951 a(n) = 3 iff prime(n) in A308784.
%F A366951 a(n) = 4 iff prime(n) in A308787.
%F A366951 a(n) = 6 iff prime(n) in A308788.
%F A366951 a(n) = 7 iff prime(n) in A308785.
%F A366951 a(n) = 8 iff prime(n) in A308789.
%F A366951 a(n) = 9 iff prime(n) in A308786.
%F A366951 a(n) = 10 iff prime(n) in A308790.
%F A366951 a(n) = 12 iff prime(n) in A308791.
%F A366951 a(n) = 14 iff prime(n) in A308792.
%F A366951 a(n) = 16 iff prime(n) in A308793.
%F A366951 a(n) = 18 iff prime(n) in A308794.
%F A366951 a(n) = A296240(n) iff prime(n) == +/- 2 (mod 5) and n > 3.
%F A366951 a(n) = 2*A296240(n) iff prime(n) == +/- 1 (mod 5) and n > 3.
%F A366951 a(n) in {2^k: k > 1} iff prime(n) in {A047650}.
%F A366951 a(n) == 3 (mod 6) iff prime(n) in {A124096}.
%F A366951 a(n) == 6 (mod 12) iff prime(n) in {A046652}.
%F A366951 a(n) == 0 (mod 14) iff prime(n) in {A125252}.
%Y A366951 Cf. A000040, A003147, A060305, A047650, A047652, A071774, A124096, A124253, A296240, A308784 - A308794.
%K A366951 nonn
%O A366951 1,1
%A A366951 _A.H.M. Smeets_, Oct 29 2023