This site is supported by donations to The OEIS Foundation.

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A246549 Prime powers p^e where p is a prime and e >= 3 (prime powers without 1, the primes, or the squares of primes). 3
 8, 16, 27, 32, 64, 81, 125, 128, 243, 256, 343, 512, 625, 729, 1024, 1331, 2048, 2187, 2197, 2401, 3125, 4096, 4913, 6561, 6859, 8192, 12167, 14641, 15625, 16384, 16807, 19683, 24389, 28561, 29791, 32768, 50653, 59049, 65536, 68921, 78125, 79507, 83521, 103823, 117649, 130321, 131072, 148877, 161051, 177147, 205379 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Consists of 8 and the terms of A088247. - R. J. Mathar, Sep 01 2014 LINKS Jens Kruse Andersen, Table of n, a(n) for n = 1..10000 MATHEMATICA With[{nn=60}, Take[Union[Flatten[Table[p^Range[3, nn/3], {p, Prime[ Range[ nn]]}]]], nn]] (* Harvey P. Dale, Dec 10 2015 *) PROG (PARI) for(n=1, 10^6, if(isprimepower(n)>=3, print1(n, ", "))); (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 CROSSREFS Cf. A000961, A246547, A246550. Sequence in context: A076467 A111231 A111307 * A076405 A099997 A053093 Adjacent sequences:  A246546 A246547 A246548 * A246550 A246551 A246552 KEYWORD nonn AUTHOR Joerg Arndt, Aug 29 2014 STATUS approved

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