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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175168 Numbers n such that 2^(n-1) mod n is a prime number. 2

%I #9 Jun 07 2016 16:26:45

%S 6,10,14,22,26,27,30,34,38,45,46,58,62,74,82,86,94,106,118,122,134,

%T 142,146,153,155,158,166,170,178,182,189,194,202,206,214,215,218,226,

%U 231,254,262,274,278,287,297,298,302,314,323

%N Numbers n such that 2^(n-1) mod n is a prime number.

%C Numbers n such that A062173(n) is prime.

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

%F A062173(a(n))=A000040(k).

%t Select[Range[323], PrimeQ[Mod[2^(#-1), #]] &]

%t Select[Range[350],PrimeQ[PowerMod[2,#-1,#]]&] (* _Harvey P. Dale_, Jun 07 2016 *)

%Y Cf. A000040, A062173.

%K nonn

%O 1,1

%A _Juri-Stepan Gerasimov_, Dec 02 2010

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)