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.

A136080 Father primes of order 11.

Original entry on oeis.org

137, 1103, 1931, 2069, 2621, 3449, 3863, 4001, 4139, 5381, 5519, 6761, 8831, 8969, 10211, 13109, 13523, 13799, 15731, 18353, 19319, 21803, 23321, 23459, 25253, 25391, 28151, 28289, 28979, 29531, 29669, 31601, 32429, 32843, 33119, 34361
Offset: 1

Views

Author

Artur Jasinski, Dec 12 2007

Keywords

Comments

For smallest father primes of order n see A136026 (also definition). For father primes of order 1 see A094524. For father primes of order 2 see A136071. For father primes of order 3 see A136072. For father primes of order 4 see A136073. For father primes of order 5 see A136074. For father primes of order 6 see A136075. For father primes of order 7 see A136076. For father primes of order 8 see A136077. For father primes of order 9 see A136078. For father primes of order 10 see A136079.

Crossrefs

Programs

  • Mathematica
    n = 11; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, Prime[k]]], {k, 1, 1500}]; a