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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071773 GCD(sfk(n),n/sfk(n)), where sfk(n)=A007947(n) is the squarefree kernel of n. 0
1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 5, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 7, 5, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 5, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 7, 3, 10, 1, 1, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

a(n)=gcd(A007947(n), A003557(n));

n is squarefree iff a(n)=1.

LINKS

Eric Weisstein's World of Mathematics, Squarefree.

FORMULA

Multiplicative with p^e -> p^ceil((e-1)/e), p prime.

CROSSREFS

Cf. A005117.

Sequence in context: A066170 A184957 A205792 * A000188 A162401 A191090

Adjacent sequences:  A071770 A071771 A071772 * A071774 A071775 A071776

KEYWORD

nonn,mult

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 24 2002

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 15 10:52 EST 2012. Contains 205763 sequences.