login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I

%S 1,4,16,76,120,127

%N "Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=128.

%C 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.

%F Determined empirically.

%K nonn,fini,full

%O 1,2

%A _Olof Forshell_, Jan 22 2012

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 January 16 05:22 EST 2022. Contains 350374 sequences. (Running on oeis4.)