login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036569 Increments used in Sedgewick-Incerpi upper bound for shell sort. 10
1, 3, 7, 21, 48, 112, 336, 861, 1968, 4592, 13776, 33936, 86961, 198768, 463792, 1391376, 3402672, 8382192, 21479367, 49095696, 114556624, 343669872, 852913488, 2085837936, 5138283696, 13166851971, 30095661648, 70223210512 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 2nd ed, section 5.2.1, pp. 91-92.

LINKS

Table of n, a(n) for n=0..27.

Robert Sedgewick, Analysis of shellsort and related algorithms, Fourth European Symposium on Algorithms, Barcelona, September, 1996.

Index entries for sequences related to sorting

FORMULA

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.

CROSSREFS

Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875.

Sequence in context: A018760 A050614 A181393 * A018303 A098545 A161707

Adjacent sequences:  A036566 A036567 A036568 * A036570 A036571 A036572

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 26 23:21 EDT 2017. Contains 288777 sequences.