This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A255973 #5 Apr 09 2015 07:58:00
%S A255973 0,1,2,3,-1,5,-2,-1,8,1,-3,-2,-1,13,1,2,-5,1,-3,-2,-1,21,1,2,3,-1,-8,
%T A255973 1,2,-5,1,-3,-2,-1,34,1,2,3,-1,5,-2,-1,-13,1,2,3,-1,-8,1,2,-5,1,-3,-2,
%U A255973 -1,55,1,2,3,-1,5,-2,-1,8,1,-3,-2,-1,-21,1,2,3,-1
%N A255973 Trace of the minimal alternating Fibonacci representation of n.
%C A255973 See A256655 for definitions.
%H A255973 Clark Kimberling, <a href="/A255973/b255973.txt">Table of n, a(n) for n = 0..1000</a>
%e A255973 Let R(k) be the minimal alternating Fibonacci representation of k. The trace of R(k) is the last term.
%e A255973 R(1) = 1, trace = 1
%e A255973 R(2) = 2, trace = 2
%e A255973 R(3) = 3, trace = 3
%e A255973 R(4) = 5 - 1, trace = -1
%e A255973 R(5) = 5, trace = 5
%e A255973 R(6) = 6 - 2, trace = -2
%t A255973 b[n_] = Fibonacci[n]; bb = Table[b[n], {n, 1, 70}];
%t A255973 h[0] = {1}; h[n_] := Join[h[n - 1], Table[b[n + 2], {k, 1, b[n]}]];
%t A255973 g = h[12]; r[0] = {0};
%t A255973 r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, -r[g[[n]] - n]]];
%t A255973 Table[Last[r[n]], {n, 0, 200}] (* A255973 *)
%Y A255973 Cf. A000045, A256655 (representations R(n)), A256656 (numbers with positive trace), A256657 (numbers with nonpositive trace), A256663 (positive part of R(n)), A256664 (nonpositive part of R(n)), A256654.
%K A255973 easy,sign
%O A255973 0,3
%A A255973 _Clark Kimberling_, Apr 08 2015