The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106807 Primes with digit sum = 67. 4

%I

%S 59899999,69899899,69899989,69979999,69997999,69999799,77899999,

%T 78997999,78998989,78999889,78999979,79699999,79879999,79889899,

%U 79979899,79979989,79988899,79989979,79996999,79997899,79997989

%N Primes with digit sum = 67.

%C 499999909 is the smallest term that contains 0 as a digit. - _Altug Alkan_, Mar 25 2018

%H Robert Israel, <a href="/A106807/b106807.txt">Table of n, a(n) for n = 1..10000</a> (first 128 terms from Vincenzo Librandi)

%p F:= proc(t,d)

%p if d = 1 then

%p if t<=9 then return [t] else return [] fi

%p fi;

%p if t > 9*d then return [] fi;

%p [seq(op(map(x -> a*10^(d-1)+x, procname(t-a,d-1))), a=0..min(9,t))]

%p end proc:

%p select(isprime, F(67,8)); # _Robert Israel_, Mar 25 2018

%t Select[Prime[Range[600000]], Total[IntegerDigits[#]]==67 &] (* _Vincenzo Librandi_, Jul 09 2014 *)

%o (MAGMA) [p: p in PrimesUpTo(90000000) | &+Intseq(p) eq 67]; // _Vincenzo Librandi_, Jul 09 2014

%o (PARI) isok(n) = isprime(n) && (sumdigits(n) == 67); \\ _Altug Alkan_, Mar 25 2018

%Y Cf. A007605, A062339, A062341, A062343, A106754 - A106787, A107617, A107618.

%Y Cf. similar sequences listed in A244018.

%K nonn,base

%O 1,1

%A _Zak Seidov_, May 18 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 17 07:50 EDT 2021. Contains 343060 sequences. (Running on oeis4.)