This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A205669 #10 Dec 07 2019 14:53:17 %S A205669 1,5,24,62 %N A205669 "Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=64. %C A205669 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 A205669 Sequence A204772 where N=128. %K A205669 nonn %O A205669 1,2 %A A205669 _Olof Forshell_, Jan 30 2012