login
A074695
Greatest common divisor of n and floor(n^(1/2))^2.
3
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
OFFSET
1,4
COMMENTS
a(n) = n iff n is a square.
a(A258613(n)) = 1; a(A258614(n)) > 1. - Reinhard Zumkeller, Jun 05 2015
LINKS
FORMULA
a(n) = GCD(n, A048760(n)).
MATHEMATICA
Table[GCD[n, Floor[Sqrt[n]]^2], {n, 100}] (* Harvey P. Dale, Aug 12 2018 *)
PROG
(Haskell)
a074695 n = gcd n $ a048760 n -- Reinhard Zumkeller, Jun 05 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 03 2002
STATUS
approved