login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076468 Perfect powers m^k where m is an integer and k > 3. 4
1, 16, 32, 64, 81, 128, 243, 256, 512, 625, 729, 1024, 1296, 2048, 2187, 2401, 3125, 4096, 6561, 7776, 8192, 10000, 14641, 15625, 16384, 16807, 19683, 20736, 28561, 32768, 38416, 46656, 50625, 59049, 65536, 78125, 83521, 100000, 104976, 117649 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

If p|n then at least p^4|n.

Subsequence of A036967. - R. J. Mathar, May 27 2011

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

a = {1}; Do[ If[ Apply[ GCD, Last[ Transpose[ FactorInteger[n]]]] > 3, a = Append[a, n]; Print[n]], {n, 2, 131071}]; a

PROG

(Haskell)

import qualified Data.Set as Set (null)

import Data.Set (empty, insert, deleteFindMin)

a076468 n = a076468_list !! (n-1)

a076468_list = 1 : f [2..] empty where

   f xs'@(x:xs) s | Set.null s || m > x ^ 4 = f xs $ insert (x ^ 4, x) s

                  | m == x ^ 4  = f xs s

                  | otherwise = m : f xs' (insert (m * b, b) s')

                  where ((m, b), s') = deleteFindMin s

-- Reinhard Zumkeller, Jun 19 2013

CROSSREFS

Cf. A001597, A076467, A076469, A076470.

Sequence in context: A339840 A172418 A036967 * A246550 A197917 A317475

Adjacent sequences:  A076465 A076466 A076467 * A076469 A076470 A076471

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Oct 14 2002

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 21:58 EDT 2021. Contains 343051 sequences. (Running on oeis4.)