|
Search: id:A112511
|
|
|
| A112511 |
|
Greatest n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers. |
|
+0
7
|
|
| 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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
See A112509 for a full explanation and example.
|
|
LINKS
|
2008/9 British Mathematical Olympiad Round 2: Jan 29 2009, Problem 4 [From Joseph Myers (jsm(AT)polyomino.org.uk), Feb 01 2009]
|
|
CROSSREFS
|
Cf. A112509 (corresponding maximum), A112510 (least n-bit number for which this maximum occurs).
A078822, A122953, A156022, A156023, A156024, A156025. [From Joseph Myers (jsm(AT)polyomino.org.uk), Feb 01 2009]
Sequence in context: A050531 A027083 A123991 this_sequence A063452 A009299 A072611
Adjacent sequences: A112508 A112509 A112510 this_sequence A112512 A112513 A112514
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Rick L. Shepherd (rshepherd2(AT)hotmail.com), Sep 09 2005
|
|
EXTENSIONS
|
a(21) to a(31) from Joseph Myers (jsm(AT)polyomino.org.uk), Feb 01 2009
|
|
|
Search completed in 0.004 seconds
|
