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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071889 GCD(A071888(n),n). 6
1, 2, 3, 2, 5, 2, 7, 2, 3, 2, 11, 2, 13, 7, 3, 2, 17, 3, 19, 2, 3, 2, 23, 2, 5, 2, 3, 2, 29, 3, 31, 2, 3, 2, 7, 2, 37, 2, 3, 2, 41, 2, 43, 2, 3, 2, 47, 3, 7, 5, 3, 2, 53, 3, 5, 2, 3, 2, 59, 2, 61, 2, 3, 2, 5, 3, 67, 2, 3, 2, 71, 2, 73, 2, 3, 2, 7, 2, 79, 2, 3, 2, 83, 2, 5, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For n>1: a(n)=n iff n is prime.

LINKS

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

PROG

(Haskell)

a071889 n = gcd n $ a071888 n  -- Reinhard Zumkeller, Jun 10 2012

(PARI) a(n)=if(n<2, return(1)); my(m=n+1); while(gcd(m++, n)==1 || !issquarefree(m), ); gcd(n, m-n) \\ Charles R Greathouse IV, May 29 2014

CROSSREFS

Cf. A071892.

Sequence in context: A092067 A214606 A079879 * A091963 A067695 A285336

Adjacent sequences:  A071886 A071887 A071888 * A071890 A071891 A071892

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jun 10 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 December 19 06:03 EST 2018. Contains 318245 sequences. (Running on oeis4.)