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).

Original entry on oeis.org

1, 65, 433, 4124459, 1208198525, 8179002097, 8179002109, 8179002125, 8179002193
Offset: 1

Views

Author

Giovanni Resta, Feb 22 2006

Keywords

Crossrefs

Cf. A116677.

Programs

  • Python
    from gmpy2 import next_prime
    def A116678(max) :
        terms = []
        p = 2
        for n in range(1, max+1) :
            if (p + 12) % n == 0 : terms.append(n)
            p = next_prime(p)
        return terms # Eric M. Schmidt, Feb 05 2013

Extensions

First term inserted by Eric M. Schmidt, Feb 05 2013