login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067815
a(n) = gcd(n, floor(sqrt(n))).
3
1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 3, 1, 1, 3, 4, 1, 2, 1, 4, 1, 2, 1, 4, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 8, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 8, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9
OFFSET
1,4
LINKS
MATHEMATICA
a[n_] := GCD[n, Floor[Sqrt[n]]]; Array[a, 100] (* Amiram Eldar, Nov 19 2024 *)
PROG
(Haskell)
a067815 n = gcd n $ a000196 n -- Reinhard Zumkeller, Jul 08 2014
(PARI) a(n) = gcd(n, sqrtint(n)); \\ Altug Alkan, Dec 19 2017
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Reinhard Zumkeller, Feb 08 2002
STATUS
approved