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 A037035 #8 Sep 28 2013 01:35:10 %S A037035 0,0,0,2,0,4,2,2,0,8,6,4,2,16,26,2,0,28,2,20,6,16,14,8,42,34,14,28,2, %T A037035 10,2,10,14,16,24,52,30,8,6,22,14,26,14,28,6,58,14,4,20,68,54,20,20,4, %U A037035 158,2,80,8,68,130,32,14,134,28,12,130,8,2,32,28,24,10,14,28,36,32,14 %N A037035 Least k such that 2^n+1+k is a prime. %e A037035 a(5)=4 because 2^5+1+4=37 that is a prime. %o A037035 (PARI) a(n) = k = 0; while (! isprime(2^n+k+1), k++); k; \\ _Michel Marcus_, Sep 27 2013 %Y A037035 Cf. A016014. %Y A037035 A013597(n) - 1. %K A037035 nonn %O A037035 0,4 %A A037035 _Felice Russo_ %E A037035 More terms from _Erich Friedman_