%I A154393
%S A154393 1,9,34,182,836,4025,19001,90358,428481,2034035,9651787,45806244,
%T A154393 217378076,1031612713,2147483647
%N A154393 Empirically good sequence of increments for shell sort algorithm.
%C A154393 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.
%H A154393 Wikipedia, <a href="http://en.wikipedia.org/wiki/Shell_sort#Implementation">
               Shell sort</a>
%F A154393 a(n) = floor(fibonacci(n+1)^(1+sqrt(5))
%Y A154393 Sequence in context: A002881 A005344 A050478 this_sequence A119389 A067960 
               A119757
%Y A154393 Adjacent sequences: A154390 A154391 A154392 this_sequence A154394 A154395 
               A154396
%K A154393 nonn
%O A154393 1,2
%A A154393 Niels Pardons (nielspardons(AT)hotmail.com), Jan 08 2009