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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Dec 07 2019 14:53:17
%S 1,5,24,62
%N "Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=64.
%C This is a fairly optimal sequence for reverse-sorting an ascending list where N = 64. Requires 4.125*N comparisons. 4.125 is approximately equal to 2.28*log_10(64). The operation performed requires a defined, substantial and certainly nontrivial amount of work which is repeatable for a list of any size.
%D Sequence A204772 where N=128.
%K nonn
%O 1,2
%A _Olof Forshell_, Jan 30 2012