OFFSET
0,3
COMMENTS
The terms are distinct. See A256655 for definitions.
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..1000
EXAMPLE
Minimal alternating Fibonacci representations:
R(0) = 0
R(1) = 1
R(2) = 2
R(3) = 3
R(4) = 5 - 1, so that a(4) = 6.
R(9) = 13 - 5 + 1, so that a(9) = 19.
MATHEMATICA
b[n_] = Fibonacci[n]; bb = Table[b[n], {n, 1, 70}];
h[0] = {1}; h[n_] := Join[h[n - 1], Table[b[n + 2], {k, 1, b[n]}]];
g = h[23]; r[0] = {0};
r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, -r[g[[n]] - n]]];
Table[Total[Abs[r[n]]], {n, 0, 100}] (* A256662 *)
Table[Total[(Abs[r[n]] + r[n])/2], {n, 0, 100}] (* A256663 *)
Table[Total[(Abs[r[n]] - r[n])/2], {n, 0, 100}] (* A256664 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 08 2015
STATUS
approved