login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128356 Least number k>1 (that is not the power of prime p) such that k divides (p+1)^k-1, where p = prime(n). 9
20, 21, 1555, 889, 253, 2041, 5846759, 148305659, 1081, 279241, 9641, 950123, 33661, 63213709997, 583223, 3775349, 72707647, 149070763, 196932497, 5091481, 25760459, 14307947980741, 13861, 9362711, 376457, 132766545553, 63757 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

All listed terms have 2 distinct prime divisors. Most listed terms are semiprimes, except a(7) = 20231*17^2 and a(8) = 410819*19^2. p = prime(n) divides a(n). Quotients a(n)/prime(n) are listed in A128357(n) = {10, 7, 311, 127, 23, 157, 343927, ...}. a(15) = 583223 = 47*12409. a(16) = 3775349 = 53*71233.

LINKS

Table of n, a(n) for n=1..27.

MATHEMATICA

(* This program is not suitable to compute a large number of terms *) a[n_] := For[p = Prime[n]; k = 2, True, k++, If[Length[FactorInteger[k]] == 2, If[Mod[PowerMod[p + 1, k, k] - 1, k] == 0, Print[k]; Return[k]]]]; Table[a[n], {n, 1, 13}] (* Jean-Fran├žois Alcover, Oct 07 2013 *)

CROSSREFS

Cf. A014960, A128360, A128358, A014960, A014956, A014951, A014949, A014946, A014945, A067945. Cf. A128357 = Quotients A128356(n)/Prime[n].

Sequence in context: A041836 A041837 A041838 * A109212 A259742 A050653

Adjacent sequences:  A128353 A128354 A128355 * A128357 A128358 A128359

KEYWORD

hard,nonn

AUTHOR

Alexander Adamchuk, Mar 02 2007

EXTENSIONS

Terms a(14) onwards from Max Alekseyev, Feb 08 2010

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 25 18:20 EDT 2017. Contains 292499 sequences.