login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180172 a(n) = gcd(prime(n)+2, n). 2
1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 11, 3, 1, 1, 1, 1, 1, 9, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 1, 1, 1, 9, 1, 1, 13, 5, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 11, 1, 1, 1, 1, 71, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 15, 7, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
MATHEMATICA
Table[GCD[n, Prime[n]+2], {n, 200}]
PROG
(Magma) [GCD(n, NthPrime(n) +2): n in [1..110]]; // G. C. Greubel, Mar 12 2023
(SageMath) [gcd(nth_prime(n) + 2, n) for n in range(1, 111)] # G. C. Greubel, Mar 12 2023
CROSSREFS
Sequence in context: A141901 A200473 A361948 * A327372 A328323 A090751
KEYWORD
nonn
AUTHOR
Zak Seidov, Aug 15 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)