

A112511


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


6



1, 2, 6, 14, 29, 61, 123, 244, 500, 1004, 2009, 4057, 8121, 16243, 32627, 65267, 130535, 261066, 523210, 1046474, 2092954, 4185909, 8371816, 16760424, 33521256, 67042536, 134085073, 268302801, 536607185, 1073214417, 2146428840
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

See A112509 for a full explanation and example.


LINKS

Table of n, a(n) for n=1..31.
2008/9 British Mathematical Olympiad Round 2: Jan 29 2009, Problem 4 [From Joseph Myers, Feb 01 2009]


CROSSREFS

Cf. A112509 (corresponding maximum), A112510 (least nbit number for which this maximum occurs).
A078822, A122953, A156022, A156023, A156024, A156025. [From Joseph Myers, Feb 01 2009]
Sequence in context: A169948 A192705 A123991 * A063452 A009299 A072611
Adjacent sequences: A112508 A112509 A112510 * A112512 A112513 A112514


KEYWORD

base,nonn


AUTHOR

Rick L. Shepherd, Sep 09 2005


EXTENSIONS

a(21) to a(31) from Joseph Myers, Feb 01 2009


STATUS

approved



