A306909 Primes p such that Omega(p + 1)^(p - 1) == 1 (mod p^2), where Omega is A001222.

2, 11, 1093, 3511, 20771, 534851, 1006003, 3152573

Offset

1,1

Comments

a(9) > 807795277 if it exists.

a(9) > 3.5*10^12 if it exists. - Giovanni Resta, Apr 09 2019

Links

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

Example

A001222(20772) = 5 and 5^(20771-1) == 1 (mod 20771^2), so 20771 is a term of the sequence.

Mathematica

Select[Prime@ Range@ 230000, PowerMod[ PrimeOmega[# + 1], #-1, #^2] == 1 &] (* Giovanni Resta, Apr 09 2019 *)

Prog

(PARI) forprime(p=1, , if(Mod(bigomega(p+1), p^2)^(p-1)==1, print1(p, ", ")))

Crossrefs

Cf. A001220, A001222, A260377, A267487.

Sequence in context: A365098 A157033 A011825 * A084673 A034388 A131316

Adjacent sequences: A306906 A306907 A306908 * A306910 A306911 A306912

Keyword

nonn,hard,more

Author

Felix Fröhlich, Mar 16 2019

Status

approved