The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112510 Least n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers. 7
 0, 2, 6, 12, 28, 56, 116, 244, 488, 984, 2008, 4016, 8048, 16240, 32480, 64968, 129992, 261064, 522128, 1044264, 2088552, 4177512, 8371816, 16743632, 33487312, 66976208, 134085072, 268170144, 536340304, 1072680624, 2145361584 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See A112509 for a full explanation and example. LINKS 2008/9 British Mathematical Olympiad Round 2: Jan 29 2009, Problem 4 [From Joseph Myers, Feb 01 2009] CROSSREFS Cf. A112509 (corresponding maximum), A112511 (greatest n-bit number for which this maximum occurs). A078822, A122953, A156022, A156023, A156024, A156025. [From Joseph Myers, Feb 01 2009] Sequence in context: A159553 A327727 A222970 * A284449 A011949 A350271 Adjacent sequences: A112507 A112508 A112509 * A112511 A112512 A112513 KEYWORD base,nonn AUTHOR Rick L. Shepherd, Sep 09 2005 EXTENSIONS a(21) to a(31) from Joseph Myers, Feb 01 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 19:12 EST 2022. Contains 358698 sequences. (Running on oeis4.)