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 A267488 #22 Aug 06 2025 17:51:17 %S A267488 4,7,18,80,242,728,2186,6560,19682,59048,177146,531440,1594322 %N A267488 Smallest b > 1 such that there exists an odd prime p with p < b such that b^(p-1) == 1 (mod p^n). %C A267488 Conjecture: For n > 3, a(n) = A024023(n). %F A267488 a(n) ~ 3^n (via the A024023 conjecture). - _Bill McEachen_, Jul 31 2025 %o A267488 (PARI) a(n) = my(b=2); while(1, forprime(p=3, b-1, if(Mod(b, p^n)^(p-1)==1, return(b))); b++) %Y A267488 Cf. A024023. %K A267488 nonn,more %O A267488 1,1 %A A267488 _Felix Fröhlich_, Jan 15 2016 %E A267488 a(11) from _Michael S. Branicky_, May 19 2022 %E A267488 a(12) from _Michael S. Branicky_, May 21 2022 %E A267488 a(13) from _Bill McEachen_, Jul 31 2025