OFFSET
2,1
COMMENTS
Note that F(2*h)/F(h) = Lucas(h) for h > 0. - Editors.
For a guide to related sequences, see A001000. - Clark Kimberling, Aug 07 2012
LINKS
W. Kuszmaul, Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations, arXiv preprint arXiv:1509.08216 [cs.DM], 2015-2017.
FORMULA
From Philippe Deléham, Feb 06 2024: (Start)
a(n) = a(n-1) + a(n-2) - 1 for n >= 8.
a(n) = 2*a(n-1) - a(n-3) for n >= 9.
a(n) = 1 + A022112(n-3) for n >= 6.
a(n) = floor(((1 + sqrt(5))/2)*a(n-1)) for n >= 8.
G.f.: x^2*(x^6+3*x^5+2*x^4-8*x^3-4*x^2+3*x+2)/((x-1)*(x^2+x-1)).
(End)
MATHEMATICA
leastSeparator[seq_] := Module[{n = 1},
Table[While[Or @@ (Ceiling[n #1[[1]]] <
2 + Floor[n #1[[2]]] &) /@ (Sort[#1, Greater] &) /@
Partition[Take[seq, k], 2, 1], n++]; n, {k, 2, Length[seq]}]];
t = Table[N[Fibonacci[h]/Fibonacci[2 h]], {h, 1, 30}]
t1 = leastSeparator[t]
(* Peter J. C. Moses, Aug 01 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
All the terms were corrected by Clark Kimberling, Aug 07 2012
More terms from Sean A. Irvine, Jul 25 2019
STATUS
approved