

A156022


Maximum number of positive numbers represented by substrings of an nbit number's binary representation


6



1, 2, 4, 6, 9, 12, 16, 21, 26, 32, 39, 46, 54, 63, 72, 82, 93, 105, 117, 130, 144, 159, 175, 191, 208, 226, 245, 264, 284, 305, 327
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Equivalently, maximum number of distinct substrings starting with a "1" digit.


LINKS

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


CROSSREFS

A078822, A112509, A112510, A112511, A122953, A156023, A156024, A156025. Equals A112509(n)1 for n >= 2.
Sequence in context: A194250 A024610 A022778 * A224809 A327094 A048171
Adjacent sequences: A156019 A156020 A156021 * A156023 A156024 A156025


KEYWORD

nonn


AUTHOR

Joseph Myers, Feb 01 2009


STATUS

approved



