login
A227471
Position of first 0 in the binary representation of prime(n), starting the count of positions at 1 for the least significant bit.
0
1, 3, 2, 4, 3, 2, 2, 3, 4, 2, 6, 2, 2, 3, 5, 2, 3, 2, 3, 4, 2, 5, 3, 2, 2, 2, 4, 3, 2, 2, 8, 3, 2, 3, 2, 4, 2, 3, 4, 2, 3, 2, 7, 2, 2, 4, 3, 6, 3, 2, 2, 5, 2, 3, 2, 4, 2, 5, 2, 2, 3, 2, 3, 4, 2, 2, 3, 2, 3, 2, 2, 4, 5, 2, 3, 8, 2, 2, 2, 2, 3, 2, 5, 2, 4, 3, 2, 2, 2
OFFSET
1,2
COMMENTS
If no zero appears in the base-2 representation, the search "falls through" and addresses the (virtual) leading zero of that prime, see A035100. - R. J. Mathar, Jul 20 2013
FORMULA
a(n) = 1+A023512(n). - Antti Karttunen, Jul 13 2013
CROSSREFS
Sequence in context: A016559 A104566 A143156 * A101403 A025509 A130079
KEYWORD
nonn
AUTHOR
STATUS
approved