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 A003560 #24 Oct 22 2023 16:56:19
%S A003560 1,1,3,3,2,3,5,7,5,9,5,6,21,13,9,15,3,11,9,15,27,4,11,5,12,25,6,9,7,6,
%T A003560 55,25,7,9,17,23,7,37,12,13,33,10,39,43,29,45,9,9,24,49,33,5,45,35,15,
%U A003560 12,30,19,29,39,6,42,41,55,4,42,13,67,6,23,35,18,34
%N A003560 Least number m such that 4^m == +- 1 (mod 4n + 1).
%H A003560 Vincenzo Librandi, <a href="/A003560/b003560.txt">Table of n, a(n) for n = 0..5000</a>
%F A003560 a(n) <= A003573(n). - _Michel Marcus_, Jun 10 2019
%t A003560 Table[Module[{m=1}, While[PowerMod[4, m, 4 n + 1]!=1 && PowerMod[4, m, 4 n + 1]!=4 n, m++]; m], {n, 0, 70}] (* _Vincenzo Librandi_, Jun 10 2019 *)
%o A003560 (PARI) a(n) = {my(m=1); while (((mm=Mod(4, 4*n+1)^m) != 1) && (mm != 4*n), m++); m;} \\ _Michel Marcus_, Jun 10 2019
%Y A003560 Cf. A003573.
%K A003560 nonn
%O A003560 0,3
%A A003560 _N. J. A. Sloane_