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!)
A180173 a(n) = gcd(prime(n)-2, n). 1
1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 13, 1, 15, 1, 1, 1, 1, 1, 1, 11, 1, 3, 5, 1, 1, 7, 1, 3, 1, 1, 3, 1, 7, 1, 1, 1, 3, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 3, 1, 1, 3, 5, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 69, 1, 1, 3, 73, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
Table[GCD[n, Prime[n]-2], {n, 200}]
CROSSREFS
Sequence in context: A014491 A214071 A226915 * A318668 A322361 A219208
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 24 08:21 EDT 2024. Contains 371926 sequences. (Running on oeis4.)