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 A244265 #20 Jan 28 2025 14:35:46 %S A244265 1,7,46,310,2411,19665,166230,1440495,12712499,113765625,1029518337, %T A244265 9401997000,86516427946,801235615814 %N A244265 Frequency of the most common final digit of a prime < 10^n. %e A244265 Of the primes < 10^2, there are 7 that end in a 3. Since 3 is the most common digit to end with (see A244191), then a(2) = 7. %o A244265 (Python) %o A244265 import sympy %o A244265 from sympy import isprime %o A244265 def prend1(d, n): %o A244265 lst = [ ] %o A244265 for k in range(10**n): %o A244265 if isprime(k): %o A244265 lst.append((k%10**d)) %o A244265 new = 0 %o A244265 newlst = [ ] %o A244265 for i in range(10**(d-1), 10**d): %o A244265 new = lst.count(i) %o A244265 newlst.append(new) %o A244265 return max(newlst) %o A244265 n = 2 %o A244265 while n < 10: %o A244265 print(prend1(1, n), end=', ') %o A244265 n += 1 %Y A244265 Cf. A244191. %K A244265 nonn,base,hard,more %O A244265 1,2 %A A244265 _Derek Orr_, Jun 24 2014 %E A244265 a(8)-a(14) from _Hiroaki Yamanouchi_, Jul 11 2014