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 #16 Sep 08 2022 08:45:05
%S 2,11,13,17,31,53,71,79,97,101,103,107,211,233,251,277,349,367,431,
%T 439,457,503,521,547,619,673,691,701,709,727,853,907,1021,1061,1069,
%U 1087,1151,1201,1223,1249,1429,1447,1483,1511,1601,1609,1627,1663,1753,1861,1933,1951,2011,2141
%N Primes whose sum of digits is a power of 2.
%C Subsequence of primes of A028838. - _Michel Marcus_, Aug 19 2015
%H Aaron Toponce, <a href="/A068807/b068807.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[ Prime@Range[ 300 ],IntegerQ[ Log[ 2,Plus@@IntegerDigits[ # ] ] ]& ] (* _Ray Chandler_, Dec 03 2009 *)
%o (Magma) [p: p in PrimesUpTo(2200) | PrimeDivisors(s) eq [2] where s is &+Intseq(p)]; // _Bruno Berselli_, Dec 26 2012
%o (PARI) lista(nn) = forprime (n=1, nn, sd = sumdigits(n); if (2^valuation(sd,2) == sd, print1(n, ", "))); \\ _Michel Marcus_, Aug 19 2015
%Y Different from A178796.
%K base,easy,nonn
%O 1,1
%A _Amarnath Murthy_, Mar 06 2002
%E Extended by _Ray Chandler_, Dec 03 2009