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 #11 Jun 24 2019 07:18:27
%S 1,2,3,3,4,4,5,5,6,6,7,7,7,7,7,7,8,8,8,8,8,8,9,9,10,10,11,11,12,12,12,
%T 12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,14,14,14,
%U 14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,16,16,16,16,16,16,16
%N Number of prime powers q<=n such that also q+2 is a prime power.
%C a(n) > A071538(n);
%C (25,27) is the smallest pair of prime powers (q,q+2) such that both q and q+2 are not primes, conjecture: there are more (but not < 10^6).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimePower.html">Prime Power</a>
%H <a href="/index/Pri#primepop">Index entries for sequences related to numbers of primes in various ranges</a>
%e a(10) = Card{(p^0,3), (2,2^2), (3,5), (5,7), (7,3^2), (3^2,11)} = 6.
%o (PARI) ispp(n) = (n==1) || isprimepower(n);
%o a(n) = sum(k=1, n, ispp(k) && ispp(k+2)); \\ _Michel Marcus_, Jun 24 2019
%Y Cf. A000961, A071538.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jan 14 2006