login

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”).

A106754
Primes p with digital sum equal to 11.
12
29, 47, 83, 137, 173, 191, 227, 263, 281, 317, 353, 443, 461, 641, 821, 911, 1019, 1091, 1109, 1163, 1181, 1217, 1307, 1361, 1433, 1451, 1523, 1613, 1721, 1811, 1901, 2027, 2063, 2081, 2153, 2207, 2243, 2333, 2351, 2423, 2441, 2531, 2621, 2711, 2801, 3251
OFFSET
1,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..41771 (first 2000 terms from Vincenzo Librandi)
FORMULA
Intersection of A000040 (primes) and A166311 (digit sum = 11), also equals { p in A000040 | A007953(p) = 11 }. - M. F. Hasler, Mar 09 2022
MATHEMATICA
Select[Prime[Range[100000]], Total[IntegerDigits[#]]==11 &] (* Vincenzo Librandi, Jul 08 2014 *)
PROG
(Magma) [p: p in PrimesUpTo(10000) | &+Intseq(p) eq 11]; // Vincenzo Librandi, Jul 08 2014
(PARI) select( {is_A106754(n)=sumdigits(n)==11&&isprime(n)}, primes([1, 3333])) \\ M. F. Hasler, Mar 09 2022
CROSSREFS
Cf. A000040 (primes), A007953 (sum of digits), A166311 (digit sum = 11).
Cf. A062339 (same for digit sum s = 4), ..., A107579 (s = 10), A106755 (s = 13), and others listed in A244918 (s = 68).
Subsequence of A119891 (prime trios: chain of prime sums of digits; also has as subsequence A106762 (s = 23), A106774 (s = 41), etc).
Sequence in context: A102852 A138052 A119891 * A222413 A063642 A108258
KEYWORD
nonn,base
AUTHOR
Zak Seidov, May 16 2005
STATUS
approved