

A156025


Number of nbit numbers whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers


6



2, 1, 1, 3, 2, 6, 5, 1, 4, 5, 2, 8, 10, 4, 16, 22, 12, 2, 10, 19, 17, 7, 1, 5, 9, 7, 2, 11, 24, 28, 20
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

If only positive integer substrings are counted (see A156022), the first two terms become 1,2 (the nbit numbers in question being 1, 10, 11 in binary) and all subsequent terms are unchanged.


LINKS

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


EXAMPLE

The nbit numbers in question are, in binary, for n <= 8: 0 1; 10; 110; 1100 1101 1110, 11100 11101; 111000 111001 111010 111011 111100 111101; 1110100 1111000 1111001 1111010 1111011; 11110100.


CROSSREFS

A078822, A112509 (corresponding maximum), A112510 (least such number), A112511 (greatest such number), A122953, A156022, A156023, A156024.
Sequence in context: A156309 A205115 A093623 * A035556 A296086 A122044
Adjacent sequences: A156022 A156023 A156024 * A156026 A156027 A156028


KEYWORD

nonn


AUTHOR

Joseph Myers, Feb 01 2009


STATUS

approved



