A218542 Number of times when an even number is encountered, when going from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.
1, 0, 1, 1, 2, 3, 8, 12, 23, 44, 86, 163, 308, 576, 1074, 1991, 3680, 6800, 12626, 23644, 44751, 85567, 164941, 319694, 621671, 1211197, 2362808, 4614173, 9018299, 17635055, 34486330, 67408501, 131642673, 256795173, 500346954, 973913365, 1894371802, 3683559071
Offset: 0
Keywords
Examples
(2^0)-1 (0) is reached from (2^1)-1 (1) with one step by subtracting A000120(1) from 1. Zero is an even number, so a(0)=1. (2^1)-1 (1) is reached from (2^2)-1 (3) with one step by subtracting A000120(3) from 3. One is not an even number, so a(1)=0. (2^2)-1 (3) is reached from (2^3)-1 (7) with two steps by first subtracting A000120(7) from 7 -> 4, and then subtracting A000120(4) from 4 -> 3. Four is an even number, but three is not, so a(2)=1.
Links
- Antti Karttunen, Table of n, a(n) for n = 0..47
Crossrefs
Cf. A219662 (analogous sequence for factorial number system).
Extensions
More terms from Antti Karttunen, Jun 05 2013
Comments