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 A083736 #18 Jun 29 2019 08:33:16 %S A083736 561,29341,46657,75361,115921,162401,252601,294409,314821,334153, %T A083736 340561,399001,410041,488881,512461,530881,552721,656601,658801, %U A083736 710533,721801,852841,1024651,1141141,1152271,1168513,1193221,1461241,1569457,1615681 %N A083736 Pseudoprimes to bases 2,5 and 7. %H A083736 Amiram Eldar, <a href="/A083736/b083736.txt">Table of n, a(n) for n = 1..8691</a> (terms 1..81 from R. J. Mathar) %H A083736 F. Richman, <a href="http://math.fau.edu/Richman/carm.htm">Primality testing with Fermat's little theorem</a> %F A083736 a(n) = n-th positive integer k(>1) such that 2^(k-1) = 1 (mod k), 5^(k-1) = 1 (mod k) and 7^(k-1) = 1 (mod k). %e A083736 a(1)=561 since it is the first number such that 2^(k-1) = 1 (mod k), 5^(k-1) = 1 (mod k) and 7^(k-1) = 1 (mod k). %t A083736 Select[Range[1, 10^5, 2], CompositeQ[#] && PowerMod[2, #-1,#] == PowerMod[5, #-1,#] == PowerMod[7, #-1,#] == 1&] (* _Amiram Eldar_, Jun 29 2019 *) %Y A083736 Intersection of A083732 and A005938. Intersection of A083733 and A005936. - _R. J. Mathar_, Apr 05 2011 %K A083736 easy,nonn %O A083736 1,1 %A A083736 Serhat Sevki Dincer (sevki(AT)ug.bilkent.edu.tr), May 05 2003