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 A005938 M4168 #48 Jul 08 2025 16:38:43
%S A005938 6,25,325,561,703,817,1105,1825,2101,2353,2465,3277,4525,4825,6697,
%T A005938 8321,10225,10585,10621,11041,11521,12025,13665,14089,16725,16806,
%U A005938 18721,19345,20197,20417,20425,22945,25829,26419,29234,29341,29857,29891,30025,30811,33227
%N A005938 Pseudoprimes to base 7.
%C A005938 According to _Karsten Meyer_, May 16 2006, 6 should be excluded, following the strict definition in Crandall and Pomerance.
%C A005938 Theorem: If both numbers q & 2q-1 are primes(q is in the sequence A005382) and n=q*(2q-1) then 7^(n-1)==1 (mod 7)(n is in the sequence) iff q=2 or mod(q,14) is in the set {1, 5, 13}. 6,703,18721,38503,88831,104653,146611,188191,... are such terms. This sequence is a subsequence of A122784. - _Farideh Firoozbakht_, Sep 14 2006
%C A005938 Composite numbers n such that 7^(n-1) == 1 (mod n).
%D A005938 R. Crandall and C. Pomerance, "Prime Numbers - A Computational Perspective", Second Edition, Springer Verlag 2005, ISBN 0-387-25282-7 Page 132 (Theorem 3.4.2. and Algorithm 3.4.3)
%D A005938 R. K. Guy, Unsolved Problems in Number Theory, A12.
%D A005938 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005938 R. J. Mathar, T. D. Noe and Hiroaki Yamanouchi, <a href="/A005938/b005938.txt">Table of n, a(n) for n = 1..87448</a> (terms a(1)-a(697) from R. J. Mathar, a(698)-a(1000) from T. D. Noe)
%H A005938 J. Bernheiden, <a href="http://www.mathe-schule.de/download/pdf/Primzahl/PSP.pdf">Pseudoprimes (Text in German)</a>
%H A005938 C. Pomerance & N. J. A. Sloane, <a href="/A001567/a001567_4.pdf">Correspondence, 1991</a>
%H A005938 F. Richman, <a href="http://math.fau.edu/Richman/carm.htm">Primality testing with Fermat's little theorem</a>
%H A005938 <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t A005938 Select[Range[31000], ! PrimeQ[ # ] && PowerMod[7, (# - 1), # ] == 1 &] (* _Farideh Firoozbakht_, Sep 14 2006 *)
%o A005938 (Python)
%o A005938 from sympy import isprime
%o A005938 def ok(n): return pow(7, n-1, n) == 1 and not isprime(n)
%o A005938 print(list(filter(ok, range(1, 34000)))) # _Michael S. Branicky_, Jun 25 2021
%Y A005938 Pseudoprimes to other bases: A001567 (2), A005935 (3), A005936 (5), A005937 (6), A005939 (10).
%Y A005938 Cf. A005382, A122784.
%K A005938 nonn
%O A005938 1,1
%A A005938 _N. J. A. Sloane_