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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122701 a(0):=0 and a(n):=2*a(floor(n/2))+n-1. 0
0, 1, 2, 5, 6, 9, 10, 17, 18, 21, 22, 29, 30, 33, 34, 49, 50, 53, 54, 61, 62, 65, 66, 81, 82, 85, 86, 93, 94, 97, 98, 129, 130, 133, 134, 141, 142, 145, 146, 161, 162, 165, 166, 173, 174, 177, 178, 209, 210, 213, 214, 221, 222, 225, 226, 241, 242, 245, 246, 253, 254 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The recurrence defining this sequence arises in the study of the Merge Sort algorithm. By the master theorem, a(n) is in BigTheta(n*lg(n)).

LINKS

Table of n, a(n) for n=0..60.

MAPLE

T[0]:=0; for n from 1 to 101 do T[n]:=2*T[floor(n/2)] + n-1; od; seq( T[n], n=1..101);

CROSSREFS

Cf. A080277.

Sequence in context: A191172 A078632 A309242 * A032925 A244749 A166087

Adjacent sequences:  A122698 A122699 A122700 * A122702 A122703 A122704

KEYWORD

nonn

AUTHOR

Peter C. Heinig (algorithms(AT)gmx.de), Oct 21 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 19:00 EDT 2019. Contains 325144 sequences. (Running on oeis4.)