|
Search: id:A033622
|
|
|
| A033622 |
|
Good sequence of increments for Shell sort. |
|
+0 9
|
|
| 1, 5, 19, 41, 109, 209, 505, 929, 2161, 3905, 8929, 16001, 36289, 64769, 146305, 260609, 587521, 1045505, 2354689, 4188161, 9427969, 16764929, 37730305, 67084289, 150958081, 268386305, 603906049, 1073643521, 2415771649
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, 2nd ed, section 5.2. 1.
R. Sedgewick, J. Algorithms 7 (1986), 159-173
|
|
LINKS
|
Frank Ellermann, Comparison of Shell sorts based on EIS sequences.
Index entries for sequences related to sorting
|
|
FORMULA
|
a(n)=9*2^n-9*2^(n/2)+1 if n is even; a(n)=8*2^n-6*2^((n+1)/2)+1 if n is odd.
|
|
CROSSREFS
|
Sequences used for Shell sort: A003462, A033622, A036562, A036564, A036569, A055875.
Adjacent sequences: A033619 A033620 A033621 this_sequence A033623 A033624 A033625
Sequence in context: A024841 A100572 A119534 this_sequence A091568 A089148 A098319
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|