Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112511
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112511 Greatest n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers. +0
3
1, 2, 6, 14, 29, 61, 123, 244, 500, 1004, 2009, 4057, 8121, 16243, 32627, 65267, 130535, 261066, 523210, 1046474 (list; graph; listen)
OFFSET

1,2

COMMENT

See A112509 for a full explanation and example.

CROSSREFS

Cf. A112509 (corresponding maximum), A112510 (least n-bit number for which this maximum occurs).

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research