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 A118953 #3 Mar 30 2012 18:50:54 %S A118953 0,0,0,1,1,1,0,1,1,1,0,1,0,1,0,0,0,1,1,1,0,0,1,0,0,1,0,1,0,0,0,1,0,1, %T A118953 0,1,1,0,0,0,0,1,0,0,0,1,1,0,0,1,0,0,1,0,0,1,1,0,0,0,0,1,0,0,0,1,0,0, %U A118953 0,0,1,1,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,1 %N A118953 Number of ways to write the n-th prime as 2^k + p, where p is prime and p < 2^k. %C A118953 0 <= a(n) <= 1, a(n) <= A078687(n); %C A118953 a(A049084(A118958(n))) = 0, a(A049084(A091932(n))) = 1; %C A118953 a(n) = A118952(A000040(n)). %K A118953 nonn %O A118953 1,1 %A A118953 _Reinhard Zumkeller_, May 07 2006