%I A036569
%S A036569 1,3,7,21,48,112,336,861,1968,4592,13776,33936,86961,198768,463792,
%T A036569 1391376,3402672,8382192,21479367,49095696,114556624,343669872,
%U A036569 852913488,2085837936,5138283696,13166851971,30095661648,70223210512
%N A036569 Increments used in Sedgewick-Incerpi upper bound for shell sort.
%D A036569 D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 
               2nd ed, section 5.2.1, pg 91-92.
%H A036569 Robert Sedgewick, <a href="http://www.cs.princeton.edu/~rs/talks/shellsort.ps">
               Analysis of shellsort and related algorithms</a>, Fourth European 
               Symposium on Algorithms, Barcelona, September, 1996.
%H A036569 <a href="Sindx_So.html#sorting">Index entries for sequences related to 
               sorting</a>
%F A036569 a(0)=1, then a(s)=a(s-r)*b(r) for r such that C(r, 2)<s<=C(r+1, 2), where 
               b() is A036567.
%Y A036569 Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, 
               A055875.
%Y A036569 Sequence in context: A092203 A018760 A050614 this_sequence A018303 A098545 
               A161707
%Y A036569 Adjacent sequences: A036566 A036567 A036568 this_sequence A036570 A036571 
               A036572
%K A036569 nonn
%O A036569 0,2
%A A036569 N. J. A. Sloane (njas(AT)research.att.com).