A241856 Smallest number of carries while adding two primes in binary, the sum of which is 2*n.

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, 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, 2, 1, 4, 3, 2, 2, 3, 1, 2, 2, 5, 4, 3, 2, 3, 2, 2, 1, 4

Offset: 2

Author

Vladimir Shevelev, Apr 30 2014

Keywords

• nonn
• base

Examples

			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.
		

Links

• Peter J. C. Moses, Table of n, a(n) for n = 2..1001

Crossrefs

Cf. A241757, A241758.

Extensions

More terms from Peter J. C. Moses, Apr 30 2014