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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191547 a(n) is the smallest number k such that 2*k*n + 1 is a prime dividing prime(n)^n + 1. 1
1, 1, 1, 150, 1342, 2366, 1628328, 942, 9, 21, 34420, 146353232490, 3, 1, 810589181792, 4268555, 623525228930150853776330584, 1, 65647507266341, 1, 1, 2, 15, 2, 9774000, 1, 328, 75, 1, 3, 44, 7, 1, 2, 1, 1, 3, 16353757, 2, 5036, 1, 23, 23, 1, 216, 1218482865908370401 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..82

EXAMPLE

a(4) = 150 because 2*150*4 + 1 = 1201, which is the smallest prime of the form 2*k*4 + 1 that divides prime(4)^4 + 1 = 7^4 + 1 = 2402 = 2*1201.

MAPLE

A191547 :=proc(n) local d, a, k ; a := -1 ; for d in numtheory[factorset](ithprime(n)^n+1) do k := (d-1)/2/n ; if type(k, 'integer') and k >0 then if a = -1 then a := k; elif k < a then a := k; end if; end if ; end do: return a ; end proc: # R. J. Mathar, Jun 08 2011

MATHEMATICA

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

  1][[1]] - 1)/(2n), {n, 1, 35}]

CROSSREFS

Cf. A062006, A191546.

Sequence in context: A251801 A211554 A073614 * A184673 A184665 A088361

Adjacent sequences:  A191544 A191545 A191546 * A191548 A191549 A191550

KEYWORD

nonn

AUTHOR

Michel Lagneau, Jun 05 2011

EXTENSIONS

a(31)-a(46) from Amiram Eldar, Feb 17 2020

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 December 8 19:21 EST 2021. Contains 349596 sequences. (Running on oeis4.)