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 A136089 #6 Mar 17 2020 03:27:10
%S A136089 5,7,13,17,19,23,41,59,61,67,79,83,101,107,109,131,137,139,163,173,
%T A136089 181,191,199,229,233,251,257,263,277,293,307,317,347,353,359,367,373,
%U A136089 389,397,419,431,461,467,521,523,569,577,587,607,613,653,683,691,709,727
%N A136089 Son primes of order 12.
%C A136089 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 9 see A136086. For son primes of order 10 see A136087. For son primes of order 11 see A136088.
%H A136089 Amiram Eldar, <a href="/A136089/b136089.txt">Table of n, a(n) for n = 1..10000</a>
%t A136089 n = 12; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
%Y A136089 Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136083, A136084, A136085, A136086, A136087, A136088, A136090, A136091.
%K A136089 nonn
%O A136089 1,1
%A A136089 _Artur Jasinski_, Dec 12 2007