This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132779 Primes p such that 33 does not divide p^n - 2 for any n. 0

%I

%S 3,5,7,11,13,19,23,31,37,43,47,53,59,61,67,71,73,79,89,97,103,109,113,

%T 127,131,137,139,151,157,163,179,181,191,193,197,199,211,223,229,241,

%U 251,257,263,269,271,277,283,307,311,313,317,331,337,349,353,367

%N Primes p such that 33 does not divide p^n - 2 for any n.

%C Primes congruent to one of {1, 3, 4, 5, 7, 10, 11, 13, 14, 16, 19, 20, 23, 25, 26, 28, 31, 32} mod 33. [_Charles R Greathouse IV_, Dec 22 2011]

%F a(n) ~ (5/4) n log n. [_Charles R Greathouse IV_, Michael B. Porter and Arkadiusz Wesolowski, Dec 24 2011]

%t Sort[Join[Transpose[FactorInteger[33]][[1]], Select[Prime[Range[73]], MemberQ[{1, 4, 5, 7, 10, 13, 14, 16, 19, 20, 23, 25, 26, 28, 31, 32}, Mod[#, 33]] &]]] (* _Arkadiusz Wesolowski_, Dec 24 2011 *)

%o (PARI) S=Set([1, 3, 4, 5, 7, 10, 11, 13, 14, 16, 19, 20, 23, 25, 26, 28, 31, 32]); forprime(p=2,1e3,if(setsearch(S,p%33),print1(p", "))) \\ _Charles R Greathouse IV_, Dec 22 2011

%K nonn,easy

%O 1,1

%A _A.K. Devaraj_, Aug 29 2007

%E Edited by Arkadiusz Wesolowski, Dec 22 2011

%E a(8)-a(56) from _Charles R Greathouse IV_, Dec 22 2011

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.

Last modified December 9 19:51 EST 2019. Contains 329879 sequences. (Running on oeis4.)