login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204772 "Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=128. 2
1, 4, 16, 76, 120, 127 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This is a fairly optimal sequence for reverse-sorting an ascending list where N = 128. Requires 4.875*N comparisons. 4.875 is approximately equal to 2.31*log_10(128). The operation performed requires a defined, substantial and certainly nontrivial amount of work which is repeatable for a list of any size.

LINKS

Table of n, a(n) for n=1..6.

FORMULA

Determined empirically.

CROSSREFS

Sequence in context: A101205 A301577 A324171 * A050540 A094559 A199214

Adjacent sequences:  A204769 A204770 A204771 * A204773 A204774 A204775

KEYWORD

nonn,fini,full

AUTHOR

Olof Forshell, Jan 22 2012

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 December 7 20:40 EST 2021. Contains 349589 sequences. (Running on oeis4.)