A093008 Smallest number of 1's to append to the binary representation of n such that primes become nonprimes and nonprimes become primes.

1, 5, 2, 2, 4, 1, 1, 1, 1, 2, 3, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 4, 2, 3, 2, 1, 3, 4, 2, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 2, 3, 7, 1, 1, 3, 4, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 3, 12, 1, 3, 1, 2, 1, 4, 1, 5, 1, 1, 1, 2, 1, 7, 1, 1, 1, 2, 2, 1, 1, 3, 1, 2, 2, 5, 6, 1, 23, 4, 6, 1, 2, 3, 3, 2, 1, 1, 1, 1, 1, 10

Offset: 1

Author

Reinhard Zumkeller, Mar 14 2004

Keywords

• nonn

Comments

n>1: a(n) = A063377(n) + A040081(n+1).

Crossrefs

Cf. A093009.