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

 

Logo

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!)
A116678 Numbers n such that prime(n) == -12 (mod n). 2

%I

%S 1,65,433,4124459,1208198525,8179002097,8179002109,8179002125,

%T 8179002193

%N Numbers n such that prime(n) == -12 (mod n).

%o def A116678(max) :

%o ....terms = []

%o ....p = 2

%o ....for n in range(1,max+1) :

%o ........if (p + 12) % n == 0 : terms.append(n)

%o ........p = next_prime(p)

%o ....return terms

%o end # _Eric M. Schmidt_, Feb 05 2013

%Y Cf. A116677.

%K nonn,changed

%O 1,2

%A _Giovanni Resta_, Feb 22 2006

%E First term from _Eric M. Schmidt_, Feb 05 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 14:27 EST 2019. Contains 329896 sequences. (Running on oeis4.)