|
%I #2 Mar 30 2012 17:28:42
%S 0,0,1,3,5,8,11,14,18,22,26,31,36,41,47,53,59,65,72,79,86,93,100,108,
%T 116,124,132,141,150,159,168
%N n(n+1)/2 - A112509(n)
%C n(n+1)/2 is the total number of nonempty substrings of an n-bit binary number; A112509 is the maximum number of substrings representing distinct integers.
%H <a href="http://www.bmoc.maths.org/home/bmo2-2009.pdf">2008/9 British Mathematical Olympiad Round 2: Jan 29 2009</a>, Problem 4
%F c_1 + o(1) <= a(n)/n^1.5 <= c_2 + o(1) for some positive constants c_1 and c_2; it seems likely a(n)/n^1.5 tends to some positive constant limit.
%Y A078822, A112509, A112510, A112511, A122953, A156022, A156024, A156025. Equals A156024(n)-1 for n >= 2.
%K nonn
%O 1,4
%A _Joseph Myers_, Feb 01 2009
|
