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 A186304 #10 Dec 24 2021 14:37:05 %S A186304 5,21,29,45,69,77,101,125,149,165,189,197,221,237,261,269,309,357,365, %T A186304 381,429,437,461,477,485,501,597,605,629,645,717,725,741,749,821,837, %U A186304 861,885,909,917,965,981,989,1029 %N A186304 A007522(n)-2. %C A186304 Extensions to Fermat’s Little Theorem precisely indicate a composite or prime number. See A186293 for an introduction to A186293-A186305. %C A186304 The sequence shows p-2 where p are the primes == 7 (mod 8). %C A186304 (k*p+(p-2)) ^ (j*(p-1)+1) == (k*p+((p-1)/2)) ^ (j*(p-1)+(p-2)) == p-2 (mod p). %H A186304 Harvey P. Dale, <a href="/A186304/b186304.txt">Table of n, a(n) for n = 1..1000</a> %t A186304 Select[Prime[Range[200]],Mod[#,8]==7&]-2 (* _Harvey P. Dale_, Dec 24 2021 *) %K A186304 nonn %O A186304 1,1 %A A186304 _Marco Matosic_, Feb 17 2011