login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025479 Largest exponents of perfect powers (A001597). 8
2, 2, 3, 2, 4, 2, 3, 5, 2, 2, 6, 4, 2, 2, 3, 7, 2, 2, 2, 3, 2, 5, 8, 2, 2, 3, 2, 2, 2, 2, 9, 2, 2, 4, 2, 6, 2, 2, 2, 2, 3, 10, 2, 2, 2, 4, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 11, 2, 7, 3, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 2, 2, 12, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 8, 2, 3, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Greatest common divisor of all prime-exponents in canonical factorization of n-th perfect power: a(n)=A052409(A001597(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 13 2002

LINKS

Daniel Forgues, Table of n, a(n) for n=1..10000

CROSSREFS

Sequence in context: A049599 A043261 A157986 * A093640 A083903 A083867

Adjacent sequences:  A025476 A025477 A025478 * A025480 A025481 A025482

KEYWORD

easy,nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Definition corrected by Daniel Forgues (squid(AT)zensearch.com), Mar 07 2009

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.