OFFSET
0,3
COMMENTS
See the MathOverflow link for a proof that the sequence coincides with the Lucas sequence, A000032, beginning at 4.
Therefore also the same as A080023 (beginning at 2). - Georg Fischer, Oct 09 2018
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..1000
MathOverflow, A possibly surprising appearance of Lucas numbers
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(n) = a(n-1) + a(n-2) for n >= 6.
G.f.: (-1 + x^4)/(-1 + x + x^2).
EXAMPLE
One can view the minimal paths in a tree having generation g(0) = {0} followed by generations g(1) = {1}, g(2) = {2, sqrt(2)}, g(3) = {3, 2*sqrt(2), 1+sqrt(2)}, and so on. Duplicates are removed as they occur. Also, a(n) = |g(n)| for n >= 0.
MATHEMATICA
t = NestList[DeleteDuplicates[Flatten[Map[{# + {0, 1}, {Last[#], 2*First[#]}} &, #], 1]] &, {{0, 0}}, 25] ; s[0] = t[[1]]; s[n_] := s[n] = Union[t[[n + 1]], s[n - 1]]; g[n_] := Complement[s[n], s[n - 1]]; g[0] = {{0, 0}}; Table[Length[g[z]], {z, 0, 25}]
CoefficientList[Series[(-1 + x^4)/(-1 + x + x^2), {x, 0, 39}], x] (* Robert G. Wilson v, Feb 28 2015 *)
PROG
(PARI) x='x+O('x^40); Vec((1-x^4)/(1-x-x^2)) \\ G. C. Greubel, Sep 30 2018
(Magma) m:=40; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!((1-x^4)/(1-x-x^2))); // G. C. Greubel, Sep 30 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 06 2015
STATUS
approved
