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 A353941 #17 May 18 2022 07:55:30 %S A353941 257,6560,110443,2387947,9236508,6826318,112184244,674273372, %T A353941 571782680,8827420195,46142113101,85760131222,287369842623, %U A353941 120773832179,83209719751,1684374218587,6358345589299,6305601215112,5800992744105,33960226045484,56924554232879,11856046381401 %N A353941 Smallest b > 1 such that b^(p-1) == 1 (mod p^8) for p = prime(n). %o A353941 (PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^8)^(p-1)==1, return(b))) %o A353941 (Python) %o A353941 from sympy import prime %o A353941 from sympy.ntheory.residue_ntheory import nthroot_mod %o A353941 def A353941(n): return 2**8+1 if n == 1 else int(nthroot_mod(1,(p:= prime(n))-1,p**8,True)[1]) # _Chai Wah Wu_, May 17 2022 %Y A353941 Row k = 8 of A257833. %Y A353941 Cf. similar sequences for p^k: A039678 (k=2), A249275 (k=3), A353937 (k=4), A353938 (k=5), A353939 (k=6), A353940 (k=7), A353942 (k=9), A353943 (k=10). %K A353941 nonn %O A353941 1,1 %A A353941 _Felix Fröhlich_, May 12 2022 %E A353941 a(7)-a(8) from _Amiram Eldar_, May 12 2022 %E A353941 More terms from _Jinyuan Wang_, May 17 2022