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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

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

Cf. A000196, A073890, A075119.

Sequence in context: A279371 A134156 A324884 * A133780 A270808 A290532

Adjacent sequences:  A067812 A067813 A067814 * A067816 A067817 A067818

KEYWORD

nonn,look

AUTHOR

Reinhard Zumkeller, Feb 08 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 05:03 EDT 2019. Contains 323473 sequences. (Running on oeis4.)