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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074695 Greatest common divisor of n and floor(n^(1/2))^2. 0
1, 1, 1, 4, 1, 2, 1, 4, 9, 1, 1, 3, 1, 1, 3, 16, 1, 2, 1, 4, 1, 2, 1, 8, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 36, 1, 2, 3, 4, 1, 6, 1, 4, 9, 2, 1, 12, 49, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 64, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 81, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 100 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

a(n)=n iff n is a square.

FORMULA

a(n) = GCD(n, A048760(n)).

CROSSREFS

Cf. A000196, A000290.

Sequence in context: A176218 A109008 A187025 * A069098 A126241 A019777

Adjacent sequences:  A074692 A074693 A074694 * A074696 A074697 A074698

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 03 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 16 14:37 EST 2012. Contains 205930 sequences.