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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102549 Optimal (best known) sequence of increments for shell sort algorithm. 2
1, 4, 10, 23, 57, 132, 301, 701, 1750 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Values were found empirically. Better than A033622, A036562, A036564, A036569, and A055875.

REFERENCES

Marcin Ciura, Best Increments for the Average Case of Shellsort, 13th International Symposium on Fundamentals of Computation Theory, Riga, Latvia, 22-24 August 2001; Lecture Notes in Computer Science 2001; Vol. 2138, pp. 106-117.

LINKS

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

Marcin Ciura, Best Increments for the Average Case of Shellsort

CROSSREFS

Cf. A033622, A036562, A036564, A036569, A055875.

Sequence in context: A200759 A159347 A137531 * A277789 A274019 A008258

Adjacent sequences:  A102546 A102547 A102548 * A102550 A102551 A102552

KEYWORD

hard,nonn

AUTHOR

Gunther Piez (gpiez(AT)web.de), Feb 24 2005

EXTENSIONS

a(8) = 1750 from Roman Dovgopol, May 08 2011

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.