%I
%S 1,2,6,14,29,61,123,244,500,1004,2009,4057,8121,16243,32627,65267,
%T 130535,261066,523210,1046474,2092954,4185909,8371816,16760424,
%U 33521256,67042536,134085073,268302801,536607185,1073214417,2146428840
%N Greatest nbit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers.
%C See A112509 for a full explanation and example.
%H <a href="http://www.bmoc.maths.org/home/bmo22009.pdf">2008/9 British Mathematical Olympiad Round 2: Jan 29 2009</a>, Problem 4 [From _Joseph Myers_, Feb 01 2009]
%Y Cf. A112509 (corresponding maximum), A112510 (least nbit number for which this maximum occurs).
%Y A078822, A122953, A156022, A156023, A156024, A156025. [From _Joseph Myers_, Feb 01 2009]
%K base,nonn
%O 1,2
%A _Rick L. Shepherd_, Sep 09 2005
%E a(21) to a(31) from _Joseph Myers_, Feb 01 2009
