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
Alois P. Heinz, Table of n, a(n) for n = 1..1000
Wikipedia, Shell sort
FORMULA
a(n) = floor(fibonacci(n+1)^(1+sqrt(5))).
MATHEMATICA
Table[Floor[Fibonacci[n + 1]^(1 + Sqrt[5])], {n, 1, 10}] (* G. C. Greubel, Sep 16 2016 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Niels Pardons (nielspardons(AT)hotmail.com), Jan 08 2009
EXTENSIONS
More terms from Alois P. Heinz, May 31 2016
STATUS
approved