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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260794 Number of steps required by R. L. Graham's generalized binary merging algorithm. 2
2, 3, 5, 7, 11, 15, 19, 27, 35, 43 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

LINKS

Table of n, a(n) for n=3..12.

R. L. Graham, On sorting by comparisons, in Proceedings of the ATLAS Symposium, 1971, pp. 263-269.

Frank K. Hwang and David N. Deutsch, A class of merging algorithms, Journal of the ACM (JACM) 20.1 (1973): 148-159. See "g" page 157.

CROSSREFS

Cf. A260795, A200310.

Sequence in context: A106532 A240556 A090693 * A277576 A260164 A280938

Adjacent sequences:  A260791 A260792 A260793 * A260795 A260796 A260797

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Aug 06 2015

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 20 02:29 EST 2018. Contains 297938 sequences.