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 A007349 M5034 #33 May 23 2025 12:14:41 %S A007349 17,29,61,97,109,113,149,181,193,229,233,257,269,313,337,389,433,461, %T A007349 509,541,577,593,701,709,821,857,937,941,953,977,1021,1033,1069,1097, %U A007349 1109,1153,1181,1193,1217,1229,1297,1301,1381,1429,1433,1549,1553,1621,1697,1709,1741,1777,1789,1861,1873,1913,1949 %N A007349 Primes with both 10 and -10 as primitive root. %C A007349 Intersection of A006883 and A002144. - _Davide Rotondo_, May 21 2025 %D A007349 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864. %D A007349 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A007349 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. %H A007349 Robert G. Wilson v, <a href="/A005596/a005596.pdf">Letter to N. J. A. Sloane, Aug. 1993</a> %H A007349 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a> %t A007349 pr=10; Select[Prime[Range[200]], MultiplicativeOrder[pr, # ] == MultiplicativeOrder[-pr, # ] == #-1 &] %t A007349 Select[Prime[Range[5,200]],PrimitiveRoot[#,10]==10&&PrimitiveRoot[#,#-10] == #-10&] (* _Harvey P. Dale_, Oct 10 2019 *) %o A007349 (PARI) forprime(p=11,2000,if(znorder(Mod(10,p))==p-1&&znorder(Mod(-10,p))==p-1,print1(p,", "))); \\ _Joerg Arndt_, May 21 2025 %Y A007349 Cf. A002144, A006883. %K A007349 nonn %O A007349 1,1 %A A007349 _N. J. A. Sloane_, _Mira Bernstein_, and _Robert G. Wilson v_