A213709 Number of steps to go from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.
1, 1, 2, 3, 5, 9, 17, 30, 54, 98, 179, 330, 614, 1150, 2162, 4072, 7678, 14496, 27418, 51979, 98800, 188309, 359889, 689649, 1325006, 2552031, 4926589, 9529551, 18463098, 35815293, 69534171, 135069124, 262448803, 510047416, 991381433, 1927317745, 3747885517
Offset: 0
Keywords
Examples
(2^0)-1 (0) is reached from (2^1)-1 (1) with one step by subtracting A000120(1) from 1. (2^1)-1 (1) is reached from (2^2)-1 (3) with one step by subtracting A000120(3) from 3. (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. Thus a(0)=a(1)=1 and a(2)=2.
Links
- Antti Karttunen, Table of n, a(n) for n = 0..47
Crossrefs
Formula
Extensions
More terms from Antti Karttunen, Jun 05 2013
Comments