cp's OEIS Frontend

A106807 Primes with digit sum = 67.

%I A106807 #16 Sep 08 2022 08:45:18
%S A106807 59899999,69899899,69899989,69979999,69997999,69999799,77899999,
%T A106807 78997999,78998989,78999889,78999979,79699999,79879999,79889899,
%U A106807 79979899,79979989,79988899,79989979,79996999,79997899,79997989
%N A106807 Primes with digit sum = 67.
%C A106807 499999909 is the smallest term that contains 0 as a digit. - _Altug Alkan_, Mar 25 2018
%H A106807 Robert Israel, <a href="/A106807/b106807.txt">Table of n, a(n) for n = 1..10000</a> (first 128 terms from Vincenzo Librandi)
%p A106807 F:= proc(t,d)
%p A106807   if d = 1 then
%p A106807      if t<=9 then return [t] else return [] fi
%p A106807   fi;
%p A106807   if t > 9*d then return [] fi;
%p A106807   [seq(op(map(x -> a*10^(d-1)+x, procname(t-a,d-1))), a=0..min(9,t))]
%p A106807 end proc:
%p A106807 select(isprime, F(67,8)); # _Robert Israel_, Mar 25 2018
%t A106807 Select[Prime[Range[600000]], Total[IntegerDigits[#]]==67 &] (* _Vincenzo Librandi_, Jul 09 2014 *)
%o A106807 (Magma) [p: p in PrimesUpTo(90000000) | &+Intseq(p) eq 67]; // _Vincenzo Librandi_, Jul 09 2014
%o A106807 (PARI) isok(n) = isprime(n) && (sumdigits(n) == 67); \\ _Altug Alkan_, Mar 25 2018
%Y A106807 Cf. A007605, A062339, A062341, A062343, A106754 - A106787, A107617, A107618.
%Y A106807 Cf. similar sequences listed in A244018.
%K A106807 nonn,base
%O A106807 1,1
%A A106807 _Zak Seidov_, May 18 2005