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!)
A084309 a(n) = gcd(prime(n)-1, n). 10
1, 2, 1, 2, 5, 6, 1, 2, 1, 2, 1, 12, 1, 14, 1, 4, 1, 6, 1, 10, 3, 2, 1, 8, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 2, 1, 4, 1, 6, 1, 4, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 20, 1, 2, 9, 2, 13, 2, 1, 4, 1, 2, 1, 2, 1, 2, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 8, 1, 6, 1, 2, 3, 2, 1, 2, 1, 2, 9, 20, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MAPLE
A084309:=n->gcd(ithprime(n)-1, n): seq(A084309(n), n=1..150); # Wesley Ivan Hurt, Feb 01 2017
MATHEMATICA
Table[GCD[Prime[w]-1, w], {w, 128}]
PROG
(PARI) a(n) = gcd(prime(n)-1, n); \\ Michel Marcus, Feb 02 2017
CROSSREFS
Sequence in context: A111934 A098509 A019910 * A047991 A296666 A120898
KEYWORD
nonn,easy
AUTHOR
Labos Elemer, Jun 13 2003
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 July 15 18:49 EDT 2024. Contains 374333 sequences. (Running on oeis4.)