|
| |
|
|
A154393
|
|
Empirically good sequence of increments for shell sort algorithm.
|
|
0
| |
|
|
1, 9, 34, 182, 836, 4025, 19001, 90358, 428481, 2034035, 9651787, 45806244, 217378076, 1031612713, 2147483647
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| This sequence was made by taking the fibonacci numbers, leaving out one of the starting 1's, raising them to the power of 2 * the golden ratio. Fractions are removed with the floor function. It works particularly well as a gap sequence for the shell sort algorithm on large arrays.
|
|
|
LINKS
| Wikipedia, Shell sort
|
|
|
FORMULA
| a(n) = floor(fibonacci(n+1)^(1+sqrt(5))
|
|
|
CROSSREFS
| Sequence in context: A005344 A050478 A204426 * A119389 A197273 A067960
Adjacent sequences: A154390 A154391 A154392 * A154394 A154395 A154396
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Niels Pardons (nielspardons(AT)hotmail.com), Jan 08 2009
|
| |
|
|
