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.

A136082 Son primes of order 5.

Original entry on oeis.org

3, 11, 17, 23, 41, 53, 59, 107, 131, 167, 173, 179, 191, 257, 263, 269, 389, 401, 431, 461, 467, 479, 521, 563, 569, 599, 647, 653, 677, 683, 719, 773, 821, 839, 857, 887, 947, 971, 1031, 1049, 1061, 1091, 1103, 1151, 1181, 1217, 1223, 1259, 1277, 1301
Offset: 1

Views

Author

Artur Jasinski, Dec 12 2007

Keywords

Comments

For smallest son primes of order n see A136027 (also definition). For son primes of order 1 see A023208. For son primes of order 2 see A023218. For son primes of order 3 see A023225. For son primes of order 4 see A023235.
Numbers in this sequence are those primes p such that 11*p + 10 is also prime. Generally, son primes of order n are the primes p such that (2n+1)*p + 2n is also prime. - Bob Selcoe, Apr 04 2015

Crossrefs

Programs

  • Mathematica
    n = 5; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
    q=10;lst={};Do[p=Prime[n];If[PrimeQ[(q+1)*p+q],AppendTo[lst,p]],{n,6!}];lst (* Vladimir Joseph Stephan Orlovsky, Mar 10 2009 *)
    Select[Prime[Range[250]],PrimeQ[11#+10]&] (* Harvey P. Dale, Aug 07 2021 *)