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 A098227 #8 Mar 26 2017 23:10:52
%S A098227 0,1,46,551,5834,58667,552131,5006366,44940852,404204977,3663002302,
%T A098227 33489857205,308457624821,2858876213963,26639628671867,
%U A098227 249393770611256,2344318816620308,22116397130086627,209317712988603747
%N A098227 Number of primes with exactly n decimal digits which have repeated digits.
%C A098227 Above n = 9, a(n) = A006879(n) because above 10 there must be repeated digits. At n = 10 the sum of digits 0+1+2+3+4+5+6+7+8+9=45 is divisible by 3, so no primes with 10 distinct decimal digits exist, all primes must have repeated digits.
%e A098227 Above n = 9 a(n) = A006879(n) because above 10 there must be a repetition. At n = 10 the sum of digits 0+1+2+3+4+5+6+7+8+9=45 is divisible by 3, so no primes with 10 distinct decimal digits exist.
%t A098227 Table[Count[Prime@ Range[If[# == 0, 1, # + 1] &@ PrimePi[10^n], PrimePi[10^(n + 1) - 1]], p_ /; Total@ Boole@ Map[# > 1 &, DigitCount@ p] > 0], {n, 0, 6}] (* _Michael De Vlieger_, Mar 26 2017 *)
%Y A098227 Cf. A006880, A006879, A098224-A098226.
%K A098227 base,nonn
%O A098227 1,3
%A A098227 _Labos Elemer_, Oct 25 2004