|
%I #22 Oct 24 2020 04:11:38
%S 8,16,27,32,64,81,125,128,243,256,343,512,625,729,1024,1331,2048,2187,
%T 2197,2401,3125,4096,4913,6561,6859,8192,12167,14641,15625,16384,
%U 16807,19683,24389,28561,29791,32768,50653,59049,65536,68921,78125,79507,83521,103823,117649,130321,131072,148877,161051,177147,205379
%N Prime powers p^e where p is a prime and e >= 3 (prime powers without 1, the primes, or the squares of primes).
%C Consists of 8 and the terms of A088247. - _R. J. Mathar_, Sep 01 2014
%H Jens Kruse Andersen, <a href="/A246549/b246549.txt">Table of n, a(n) for n = 1..10000</a>
%F Sum_{n>=1} 1/a(n) = Sum_{p prime} 1/(p^2*(p-1)) = A152441. - _Amiram Eldar_, Oct 24 2020
%t With[{nn=60},Take[Union[Flatten[Table[p^Range[3,nn/3],{p,Prime[ Range[ nn]]}]]],nn]] (* _Harvey P. Dale_, Dec 10 2015 *)
%o (PARI) for(n=1, 10^6, if(isprimepower(n)>=3, print1(n, ", ")));
%o (PARI) m=10^6; v=[]; forprime(p=2, m^(1/3), e=3; while(p^e<=m, v=concat(v, p^e); e++)); v=vecsort(v) \\ Faster program. _Jens Kruse Andersen_, Aug 29 2014
%Y Cf. A000961, A152441, A246547, A246550.
%K nonn
%O 1,1
%A _Joerg Arndt_, Aug 29 2014
|
