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 A063273 #9 Feb 15 2015 10:17:24 %S A063273 1,1,1,1,2,3,4,5,5,5,6,6,7,7,7,7,7,8,8,9,9,9,9,9,9,11,12,13,14,16,17, %T A063273 19,20,21,22,24,25,26,27,28,29,31,33,34,35,36,38,38,38,38,38,38,39,40, %U A063273 40,40,40,41,41,42,42,42,42,44,45,46,47,47,47,47,47,47,47,47,47,47,47 %N A063273 Number of times most common digit of primes appears in first n primes. %C A063273 Apart from the first four cases, 1 seems to be the most common digit of the first n primes. %H A063273 Enrique Pérez Herrero, <a href="/A063273/b063273.txt">Table of n, a(n) for n = 1..1000</a> %e A063273 a(6)=3 since first six primes are 2,3,5,7,11,13, so most common digit is 1 which has appeared 3 times. %t A063273 A063273[n_Integer]:=Max[Tally[Flatten[IntegerDigits[Prime[Range[n]]]]][[All,2]]]; Array[A063273, 100] (* _Enrique Pérez Herrero_, Jun 04 2011 *) %Y A063273 Cf. A000040, A019518, A063272. %K A063273 base,nonn %O A063273 1,5 %A A063273 _Henry Bottomley_, Jul 13 2001