A136086 Son primes of order 9.

5, 7, 11, 19, 29, 31, 41, 47, 67, 71, 89, 97, 109, 137, 139, 151, 157, 167, 181, 197, 211, 241, 251, 271, 277, 307, 311, 337, 367, 379, 397, 409, 421, 509, 557, 571, 587, 599, 601, 607, 619, 631, 641, 659, 661, 691, 701, 719, 727, 757, 769, 797, 811, 827, 839

Offset: 1

Author

Artur Jasinski, Dec 12 2007

Keywords

• nonn

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. For son primes of order 5 see A136082. For son primes of order 6 see A136083. For son primes of order 7 see A136084. For son primes of order 8 see A136085.

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136083, A136084, A136085, A136087, A136088, A136089, A136090, A136091.

Programs

Mathematica

n = 9; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
q=18;lst={};Do[p=Prime[n];If[PrimeQ[(q+1)*p+q],AppendTo[lst,p]],{n,6!}];lst (* Vladimir Joseph Stephan Orlovsky, Mar 10 2009 *)