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 A191248 #12 Feb 18 2019 14:48:10
%S A191248 1,1,1,1,2,3,4,2,5,2,6,2,3,6,3,2,7,8,7,6,3,9,3,9,3,9,3,10,3,7,2,19,2,
%T A191248 12,12,24,13,15,14,9,2,16,3,12,13,17,38,4,38,38,4,21,39,4,19,40,4,18,
%U A191248 41,42,23,42,23,23,45,29,47,47,34,26,47,38,21,47,7
%N A191248 The number of times that the n-th digit of A019518(n) occurs in A019518(n).
%H A191248 Nathaniel Johnston, <a href="/A191248/b191248.txt">Table of n, a(n) for n = 1..10000</a>
%p A191248 with(StringTools): lim:=100: s:="": for j from 1 to lim do s:=cat(s, convert(ithprime(j),string)): printf("%d, ", nops([SearchAll(s[j], s)])); od: # _Nathaniel Johnston_, May 28 2011
%Y A191248 Cf. A019518, A191233.
%K A191248 nonn,easy,base,less
%O A191248 1,5
%A A191248 _Juri-Stepan Gerasimov_, May 28 2011
%E A191248 Corrected and extended by _Nathaniel Johnston_, May 28 2011