The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268174 Integers m such that m^(m+1) == 1 (modulo (m+2)). 1

%I #8 Mar 18 2016 12:58:52

%S 1,3,5,9,11,15,17,21,27,29,35,39,41,45,51,57,59,65,69,71,77,81,87,95,

%T 99,101,105,107,111,125,129,135,137,147,149,155,161,165,171,177,179,

%U 189,191,195,197,209,221,225,227,231,237,239,249,255,261,267,269,275,279,281,291,305,309,311,315,329,335,339,345

%N Integers m such that m^(m+1) == 1 (modulo (m+2)).

%C Integers m such that A110146(m)=1.

%C Note that in many cases these terms are also in A040976 (primes minus 2).

%C First terms that are not in A040976 are: 339, 559, 643, 1103, 1385, 1727, 1903, 2045, 2463, 2699, 2819. What is the pattern of these numbers?

%H Harvey P. Dale, <a href="/A268174/b268174.txt">Table of n, a(n) for n = 1..1000</a>

%t Select[Range[400],PowerMod[#,#+1,#+2]==1&] (* _Harvey P. Dale_, Mar 18 2016 *)

%Y Cf. A110146, A040976 (prime(n) - 2).

%K nonn

%O 1,2

%A _Zak Seidov_, Jan 28 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 03:10 EDT 2024. Contains 375984 sequences. (Running on oeis4.)