# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a190868 Showing 1-1 of 1 %I A190868 #21 Mar 06 2016 19:23:02 %S A190868 0,14,106,598,3002,14142,64106,283166,1228346,5257966,22281738, %T A190868 93689246,391512666,1627925006,6741353258,27821715326,114493140090, %U A190868 470023545198,1925545015370,7874137194718,32148981709466,131077794504654,533774656417642,2171261671337534,8823512782678714,35825200435380270 %N A190868 Let C(n) be the expected length of the longest carry chain when two n-bit binary numbers are added; sequence gives a(n) = 2^(2n-1)*C(n). %C A190868 The addition is carried out by a parallel adder as described by J. von Neumann. %H A190868 Volker Claus, Die mittlere Additionsdauer eines Paralleladdierwerks, Acta Informat. 2 (1973), 283-291. %H A190868 D. E. Knuth, The average time for carry propagation, Nederl. Akad. Wetensch. Indag. Math., 81 (2) (1978), 238-242. %H A190868 Nicholas Pippenger, Analysis of carry propagation in addition: an elementary approach, J. Algorithms 42 (2002), 317-333. %F A190868 C(n) = E(n)-1, where E(n) is defined in A190866. %e A190868 C(n) for n >= 2: 0, 7/16, 53/64, 299/256, 1501/1024, 7071/4096, 32053/16384, 141583/65536, ... %p A190868 See A190866. %Y A190868 Cf. A190866. %K A190868 nonn,frac %O A190868 2,2 %A A190868 _R. J. Mathar_ and _N. J. A. Sloane_, May 22 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE