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 A241856 #12 May 06 2014 11:04:55 %S A241856 1,2,3,2,3,2,4,3,2,1,3,3,2,1,5,2,3,3,3,2,2,1,4,3,3,1,3,1,2,2,6,5,6,2, %T A241856 3,3,2,1,4,3,2,2,3,1,2,1,5,5,2,1,3,2,2,1,4,1,2,1,3,3,2,1,7,4,5,2,3,3, %U A241856 2,1,4,3,2,2,3,1,2,2,5,4,3,2,3,2,2,1,4 %N A241856 Smallest number of carries while adding two primes in binary, the sum of which is 2*n. %H A241856 Peter J. C. Moses, <a href="/A241856/b241856.txt">Table of n, a(n) for n = 2..1001</a> %e A241856 Let n=5. We have 2*5=10=3+7=5+5. Adding 3+7 in binary requires 3 carries, while adding 5+5 in binary requires 2 carries. Thus a(5)=2. %Y A241856 Cf. A241757, A241758. %K A241856 nonn,base %O A241856 2,2 %A A241856 _Vladimir Shevelev_, Apr 30 2014 %E A241856 More terms from _Peter J. C. Moses_, Apr 30 2014