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 A136090 #6 Mar 17 2020 03:27:26
%S A136090 3,23,29,31,43,59,73,83,101,109,139,149,193,199,223,233,251,263,293,
%T A136090 311,331,359,379,389,401,409,421,433,443,449,461,463,479,499,541,563,
%U A136090 571,601,641,643,653,739,769,773,821,823,829,839,853,863,881,911,991,1019
%N A136090 Son primes of order 13.
%C A136090 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. For son primes of order 12 see A136088.
%H A136090 Amiram Eldar, <a href="/A136090/b136090.txt">Table of n, a(n) for n = 1..10000</a>
%t A136090 n = 13; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
%Y A136090 Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136083, A136084, A136085, A136086, A136087, A136088, A136089, A136091.
%K A136090 nonn
%O A136090 1,1
%A A136090 _Artur Jasinski_, Dec 12 2007