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.

A116677 Numbers k such that prime(k) == 12 (mod k).

Original entry on oeis.org

1, 91, 4124467, 27067043, 27067229, 27067261, 27067523, 1208198857, 8179002137, 8179002191
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A004648, A023143 - A023152, A116657, A116658, A116659: prime(n) == m (mod n), m=1..14.
Cf. A116678.

Programs

  • Mathematica
    NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 12, Print[n]], {n, 10^9}]
  • Sage
    def A116677(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