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 A285933 #13 May 06 2017 20:41:30
%S A285933 1,1,2,3,14,1,2,10,8,3,17,28,62,8,58,20,64,1,12,75,14,6,197,41,128,63,
%T A285933 14,65,8,58,114,98,63,45,124,36,72,516,28,45,43,183,2,25,142,68,249,
%U A285933 30,324,155,188,200,334,56,87,178,98,110,22,25,24,70,2,271,17,498,412,750,877
%N A285933 a(n) = smallest k such that (6*k-3)*2^n-1 and (6*k-3)*2^n+1 are twin primes.
%C A285933 Conjecture: a(n) is ~ (n*log(2))^2/9 as n increases.
%H A285933 Pierre CAMI, <a href="/A285933/b285933.txt">Table of n, a(n) for n = 1..1000</a>
%e A285933 (6*1-3)*2^1-1 = 5, (6*1-3)*2^1+1 = 7; 5 and 7 are twin primes so a(1) = 1.
%e A285933 (6*1-3)*2^2-1 = 11, (6*1-3)*2^2+1 = 13; 11 and 13 are twin primes so a(2) = 1.
%t A285933 Table[k = 1; While[Times @@ Boole@ PrimeQ[(6 k - 3) 2^n + {-1, 1}] < 1, k++]; k, {n, 69}] (* _Michael De Vlieger_, May 04 2017 *)
%o A285933 (PARI) a(n) = {my(k=1); while (!isprime((6*k-3)*2^n-1) || !isprime((6*k-3)*2^n+1), k++); k;} \\ _Michel Marcus_, May 01 2017
%Y A285933 Cf. A285808.
%K A285933 nonn
%O A285933 1,3
%A A285933 _Pierre CAMI_, Apr 29 2017