login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088864 Maximum of the products of left and right parts when splitting the binary representation of n. 0
0, 0, 1, 0, 2, 2, 3, 0, 4, 4, 6, 4, 6, 6, 9, 0, 8, 8, 12, 8, 10, 12, 15, 8, 12, 12, 18, 12, 15, 18, 21, 0, 16, 16, 24, 16, 20, 24, 28, 16, 20, 20, 30, 24, 26, 30, 35, 16, 24, 24, 36, 24, 30, 36, 42, 24, 28, 30, 42, 36, 39, 42, 49, 0, 32, 32, 48, 32, 40, 48, 56, 32, 36, 40, 54 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

COMMENTS

a(2^n) = 0, a(2^n + 1) = 2^(n-1).

LINKS

Index entries for sequences related to binary expansion of n

FORMULA

a(n) = Max{floor(n/(2^k))*(n mod 2^k)}.

EXAMPLE

n=77 -> '1001101': a(77) = Max{'1'*'001101', '10'*'01101',

'100'*'1101', '1001'*'101', '10011'*'01', '100110'*'1'} = Max{1*13, 2*13,

4*13, 9*5, 19*1, 38*1} = Max{13, 26, 52, 45, 19, 38} = 52.

CROSSREFS

Cf. A007088.

Sequence in context: A060755 A104594 A079626 * A191361 A199784 A127466

Adjacent sequences:  A088861 A088862 A088863 * A088865 A088866 A088867

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 26 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:58 EST 2012. Contains 205614 sequences.