
MATHEMATICA

cnt = 0; Table[Do[p = Prime[k]; If[MemberQ[IntegerDigits[p], 1], cnt++], {k, 10^(n  1) + 1, 10^n}]; cnt, {n, 5}] (* T. D. Noe, Nov 13 2013 *)
Module[{nn=7, p}, p=Table[If[DigitCount[p, 10, 1]>0, 1, 0], {p, Prime[ Range[ 10^nn]]}]; Table[Total[Take[p, 10^k]], {k, nn}]] (* The program generates the first 7 terms of the sequence; to generate more, increase the value of nn but the program may take a long time to run. *) (* Harvey P. Dale, Sep 27 2019 *)
