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 A353942 #16 May 18 2022 07:55:34 %S A353942 513,19682,280182,14906455,676386984,822557039,8185328614,1835323405, %T A353942 147534349327,430099398783,746688111476,3054750102760,9430469115218, %U A353942 42562034654367,92084372092298,28307243117603,17362132628379,430275700643181,478910674129864,69114209866295 %N A353942 Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n). %o A353942 (PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^9)^(p-1)==1, return(b))) %o A353942 (Python) %o A353942 from sympy import prime %o A353942 from sympy.ntheory.residue_ntheory import nthroot_mod %o A353942 def A353942(n): return 2**9+1 if n == 1 else int(nthroot_mod(1,(p:= prime(n))-1,p**9,True)[1]) # _Chai Wah Wu_, May 17 2022 %Y A353942 Row k = 9 of A257833. %Y A353942 Cf. similar sequences for p^k: A039678 (k=2), A249275 (k=3), A353937 (k=4), A353938 (k=5), A353939 (k=6), A353940 (k=7), A353941 (k=8), A353943 (k=10). %K A353942 nonn %O A353942 1,1 %A A353942 _Felix Fröhlich_, May 12 2022 %E A353942 a(5)-a(6) from _Amiram Eldar_, May 12 2022 %E A353942 More terms from _Jinyuan Wang_, May 17 2022