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!)
A084311 a(n) = gcd(prime(n)-1,n-1). 4
1, 1, 2, 3, 2, 1, 2, 1, 2, 1, 10, 1, 4, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 24, 25, 2, 1, 4, 1, 6, 1, 8, 3, 2, 5, 12, 1, 2, 1, 2, 1, 2, 1, 4, 9, 2, 1, 2, 1, 2, 17, 4, 1, 2, 1, 4, 3, 2, 1, 6, 1, 2, 1, 8, 1, 66, 1, 2, 3, 2, 1, 6, 1, 2, 1, 4, 11, 2, 1, 2, 3, 2, 1, 6, 17, 2, 3, 4, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 9, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
Table[GCD[Prime[w]-1, w-1], {w, 1, 128}]
PROG
(PARI) a(n) = gcd(prime(n)-1, n-1); \\ Michel Marcus, May 04 2017
CROSSREFS
Sequence in context: A126626 A137927 A321864 * A353486 A026490 A053555
KEYWORD
nonn
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 April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)