login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136082 Son primes of order 5. 15
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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

LINKS

Table of n, a(n) for n=1..50.

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 *)

CROSSREFS

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

Sequence in context: A153419 A079020 A118590 * A106083 A113803 A226423

Adjacent sequences:  A136079 A136080 A136081 * A136083 A136084 A136085

KEYWORD

nonn

AUTHOR

Artur Jasinski, Dec 12 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 11:06 EST 2020. Contains 331083 sequences. (Running on oeis4.)