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.
%I A136087 #11 Mar 17 2020 03:27:57
%S A136087 3,7,11,13,19,23,37,41,59,61,67,71,73,89,101,107,109,113,127,137,139,
%T A136087 151,167,179,181,193,197,211,223,227,239,241,257,269,271,293,311,331,
%U A136087 347,349,353,359,367,373,409,419,421,439,443,463,479,487,491,499,509
%N A136087 Son primes of order 10.
%C A136087 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. For son primes of order 8 see A136086.
%H A136087 Amiram Eldar, <a href="/A136087/b136087.txt">Table of n, a(n) for n = 1..10000</a>
%t A136087 n = 10; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
%t A136087 q=20;lst={};Do[p=Prime[n];If[PrimeQ[(q+1)*p+q],AppendTo[lst,p]],{n,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Mar 10 2009 *)
%Y A136087 Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136083, A136084, A136085, A136086, A136088, A136089, A136090, A136091.
%K A136087 nonn
%O A136087 1,1
%A A136087 _Artur Jasinski_, Dec 12 2007