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 A102549 #34 Dec 03 2023 18:38:25 %S A102549 1,4,10,23,57,132,301,701,1750 %N A102549 Optimal (best known) sequence of increments for shell sort algorithm. %C A102549 Values were found empirically. Better than A033622, A036562, A036564, A036569, and A055875. %H A102549 Marcin Ciura, <a href="https://doi.org/10.1007/3-540-44669-9_12">Best Increments for the Average Case of Shellsort</a>, in R. Freivalds, (ed.), Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 2001, Lecture Notes in Computer Science, vol. 2138, Springer, pp. 106-117. %e A102549 a(0) = 1 performs a single pass of Shellsort with a gap size of 1 (which is identical to the Insertion Sort algorithm). %e A102549 a(1) = 4 performs a single pass of Shellsort with a gap size of 4 (exchanging elements 4 positions apart if they are out of order). %Y A102549 Cf. A033622, A036562, A036564, A036569, A055875. %K A102549 hard,nonn %O A102549 0,2 %A A102549 Gunther Piez (gpiez(AT)web.de), Feb 24 2005 %E A102549 a(8) = 1750 from _Roman Dovgopol_, May 08 2011