login
This site is supported by donations 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

Ivan Neretin, Table of n, a(n) for n = 1..10000

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

Cf. A000040, A084309-A084316.

Sequence in context: A126626 A137927 A321864 * A026490 A053555 A324645

Adjacent sequences:  A084308 A084309 A084310 * A084312 A084313 A084314

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 22 17:25 EDT 2019. Contains 321422 sequences. (Running on oeis4.)