Let E(n) be the average number of steps required for the addition of two binary numbers of length n; sequence gives a(n) = 2^(2n-1)*E(n).

A190866

Let E(n) be the average number of steps required for the addition of two binary numbers of length n; sequence gives a(n) = 2^(2n-1)*E(n).

Terms

    a(0) =1a(1) =8a(2) =46a(3) =234a(4) =1110a(5) =5050a(6) =22334a(7) =96874a(8) =414238a(9) =1752634a(10) =7355118a(11) =30670346a(12) =127243678a(13) =525730394a(14) =2164795918a(15) =8888836906a(16) =36411649918a(17) =148852878458a(18) =607462498670

External references