cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A116678 Numbers k such that prime(k) == -12 (mod k).

This page as a plain text file.
%I A116678 #14 Jun 21 2025 20:00:24
%S A116678 1,65,433,4124459,1208198525,8179002097,8179002109,8179002125,
%T A116678 8179002193
%N A116678 Numbers k such that prime(k) == -12 (mod k).
%o A116678 (Python)
%o A116678 from gmpy2 import next_prime
%o A116678 def A116678(max) :
%o A116678     terms = []
%o A116678     p = 2
%o A116678     for n in range(1, max+1) :
%o A116678         if (p + 12) % n == 0 : terms.append(n)
%o A116678         p = next_prime(p)
%o A116678     return terms # _Eric M. Schmidt_, Feb 05 2013
%Y A116678 Cf. A116677.
%K A116678 nonn
%O A116678 1,2
%A A116678 _Giovanni Resta_, Feb 22 2006
%E A116678 First term inserted by _Eric M. Schmidt_, Feb 05 2013