



0, 0, 1, 3, 5, 8, 11, 14, 18, 22, 26, 31, 36, 41, 47, 53, 59, 65, 72, 79, 86, 93, 100, 108, 116, 124, 132, 141, 150, 159, 168
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

n(n+1)/2 is the total number of nonempty substrings of an nbit binary number; A112509 is the maximum number of substrings representing distinct integers.


LINKS

Table of n, a(n) for n=1..31.
2008/9 British Mathematical Olympiad Round 2: Jan 29 2009, Problem 4


FORMULA

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.


CROSSREFS

A078822, A112509, A112510, A112511, A122953, A156022, A156024, A156025. Equals A156024(n)1 for n >= 2.
Sequence in context: A248611 A005356 A060432 * A261223 A062009 A062484
Adjacent sequences: A156020 A156021 A156022 * A156024 A156025 A156026


KEYWORD

nonn


AUTHOR

Joseph Myers, Feb 01 2009


STATUS

approved



