login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191548 Smallest prime factor of prime(n)^n - 1 having the form k*n + 1. 2
31, 5, 3221, 7, 25646167, 17, 19, 11, 23, 13, 11831, 5839, 31, 17, 137, 19, 751410597400064602523400427092397, 661, 127, 23, 47, 46644217, 101, 79, 2377, 29, 7193, 31, 1310825268269643509279336731098526398390609803239319801398048897, 97, 755569 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

LINKS

Amiram Eldar, Table of n, a(n) for n = 3..96

EXAMPLE

a(3) = 31 because prime(3)^3 - 1 = 5^3 - 1 = 124 = 2^2*31; the smallest prime divisor of the form k*n + 1 is 31 = 10*3 + 1 with k = 10.

MATHEMATICA

Table[p = First /@ FactorInteger[Prime[n]^n - 1]; Select[p, Mod[#1, n] ==

  1 &, 1][[1]], {n, 3, 30}]

CROSSREFS

Cf. A069460 (greatest prime factor of prime(n)^n-1).

Sequence in context: A040940 A040941 A213917 * A040938 A040939 A040937

Adjacent sequences:  A191545 A191546 A191547 * A191549 A191550 A191551

KEYWORD

nonn

AUTHOR

Michel Lagneau, Jun 05 2011

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 November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)