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 A136083 #11 Mar 17 2020 03:24:39
%S A136083 7,13,17,23,29,43,53,67,79,83,109,113,127,149,157,163,179,193,227,233,
%T A136083 239,277,283,293,307,317,347,349,359,367,373,433,449,457,487,503,557,
%U A136083 563,587,619,647,653,673,727,739,769,773,787,809,823,829,883,919,947
%N A136083 Son primes of order 6.
%C A136083 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.
%H A136083 Amiram Eldar, <a href="/A136083/b136083.txt">Table of n, a(n) for n = 1..10000</a>
%t A136083 n = 6; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
%t A136083 q=12;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 A136083 Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136084, A136085, A136086, A136087, A136088, A136089, A136090, A136091.
%K A136083 nonn
%O A136083 1,1
%A A136083 _Artur Jasinski_, Dec 12 2007