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 A232068 #6 Nov 20 2013 13:33:21 %S A232068 0,0,1,1,0,8,1,2,0,7,0,5,0,203,1,3,2,3,0,3,3,0,2,1,0,1,2,7,0,1,1,5,2, %T A232068 1,8,2,0,501,3,1,8,3,0,1,2,0,0,1,22,3,1,4,5,0,2,4,11,1,6,1,2,5,0,3,0, %U A232068 7,1,0,1,18,8,3,13,5,6,2,3,34,1,2,3,4,19,5,6,4,1 %N A232068 Least k such that prime(n) + 2^(k+L) is a prime, where L is the length of binary representation of prime(n): L = A070939(A000040(n)). a(n)=-1 if no such k exists. %C A232068 Prime(n) is in A065047 if and only if a(n)=0. %Y A232068 Cf. A000040, A070939, A065047, A094076. %K A232068 nonn,base,less %O A232068 2,6 %A A232068 _Alex Ratushnyak_, Nov 17 2013