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 A255885 #20 May 19 2022 12:08:41
%S A255885 17,65,145,485,649,1297,577,2024,5185,8182,7057,8749,14401,30753,
%T A255885 56449,57601,77401,129473,51841,129601,254017,296449,202501,389377
%N A255885 Smallest base b such that there exist exactly n Wieferich pseudoprimes (composites c satisfying b^(c-1) == 1 (mod c^2)) less than b.
%o A255885 (PARI) for(n=1, 10, b=2; while(b > 0, i=0; forcomposite(c=2, b, if(Mod(b, c^2)^(c-1)==1, i++)); if(i==n, print1(b, ", "); break({1})); b++))
%o A255885 (Python)
%o A255885 from itertools import count
%o A255885 from sympy import isprime
%o A255885 def A255885(n):
%o A255885 for b in count(1):
%o A255885 if n == sum(1 for c in range(2,b+1) if not isprime(c) and pow(b,c-1,c**2) == 1):
%o A255885 return b # _Chai Wah Wu_, May 18 2022
%Y A255885 Cf. A244752, A252232, A255901.
%K A255885 nonn,more
%O A255885 1,1
%A A255885 _Felix Fröhlich_, Mar 09 2015
%E A255885 a(20) from _Chai Wah Wu_, May 18 2022
%E A255885 a(21)-a(24) from _Chai Wah Wu_, May 19 2022