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.

A116662 Numbers k such that prime(k) == 15 (mod k).

Original entry on oeis.org

1, 2, 4, 13, 14, 41, 46, 446, 1066, 16054, 251713, 251738, 251764, 251789, 27067052, 27067124, 465769808, 465769816, 1208198606, 1208198632, 145935689368
Offset: 1

Views

Author

Zak Seidov, Feb 21 2006

Keywords

Comments

Starting with a(6), positions of 15 in A004648. - corrected by Eric M. Schmidt, Feb 05 2013

Crossrefs

Cf. A004648; A023143-A023152, A116657, A116677, A116658, A116659, prime(n) == m (mod n), m=1-10,11,12,13,14.

Programs

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

Extensions

More terms from Ryan Propper, Jul 21 2006
a(21) from Donovan Johnson, Dec 07 2008
Edited by and first five terms inserted by Eric M. Schmidt, Feb 05 2013