Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #29 Mar 16 2022 16:39:15
%S 189997999,199799989,199898899,199997899,199997989,199998889,
%T 268999999,269998999,278989999,278999989,279889999,279988999,
%U 287998999,287999989,288998989,288999889,288999979,289699999,289789999,289889989
%N Primes with digital sum 70.
%C The sequence begins with 8438 9-digit numbers.
%C Then there are 739572 10-digit numbers.
%C All terms == 7 (mod 18).
%H T. D. Noe, <a href="/A181321/b181321.txt">Table of n, a(n) for n = 1..8438</a>
%t Select[Prime[Range[3*10^8]], Total[IntegerDigits[#]]==70 &] (* _Vincenzo Librandi_, Jul 09 2014 *)
%o (Magma) [p: p in PrimesUpTo(3*10^8) | &+Intseq(p) eq 70]; // _Vincenzo Librandi_, Jul 09 2014
%o (Python) # see code in A107579 which can be used to produce this sequence by giving the initial term p = 189997999 (or 8*10**7-1, for digit sum 70). - _M. F. Hasler_, Mar 16 2022
%Y Cf. A073867, A111380, A181178, A181182.
%Y Cf. similar sequences listed in A244918.
%K nonn,base
%O 1,1
%A _Zak Seidov_, Jan 26 2011