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 A333269 #22 Jan 10 2025 01:18:39 %S A333269 1,3,5,3585,4911,5709,1688565,7361691,16747709,3226850283899, %T A333269 8814126944005,33226030397603 %N A333269 Positive integers n such that 17^n == 2 (mod n). %C A333269 No other terms below 10^16. Some larger term: 95549099691107109423357503242294996525424418266995858732192019626694044445113. - _Max Alekseyev_, Jan 09 2025 %o A333269 (PARI) for(k=1, 1e6, if(Mod(17, k)^k==2, print1(k", "))) %o A333269 (Python) %o A333269 A333269_list = [n for n in range(1,10**6) if n == 1 or pow(17,n,n) == 2] # _Chai Wah Wu_, Mar 14 2020 %Y A333269 Cf. Solutions to b^n == 2 (mod n): A015919 (b=2), A276671 (b=3), A130421 (b=4), A124246 (b=5), A277401 (b=7), A116622 (b=13), this sequence (b=17). %K A333269 nonn,more %O A333269 1,2 %A A333269 _Seiichi Manyama_, Mar 14 2020 %E A333269 a(10)-a(12) from _Max Alekseyev_, Jan 09 2025