cp's OEIS Frontend

A256660 Number of terms in the minimal alternating Fibonacci representation of n.

%I A256660 #4 Apr 09 2015 07:59:22
%S A256660 1,1,1,1,2,1,2,2,1,3,2,2,2,1,3,3,2,3,2,2,2,1,3,3,3,4,2,3,3,2,3,2,2,2,
%T A256660 1,3,3,3,4,3,4,4,2,3,3,3,4,2,3,3,2,3,2,2,2,1,3,3,3,4,3,4,4,3,5,4,4,4,
%U A256660 2,3,3,3,4,3,4,4,2,3,3,3,4,2,3,3,2,3
%N A256660 Number of terms in the minimal alternating Fibonacci representation of n.
%C A256660 See A256655 for definitions.
%H A256660 Clark Kimberling, <a href="/A256660/b256660.txt">Table of n, a(n) for n = 0..1000</a>
%t A256660 b[n_] = Fibonacci[n]; bb = Table[b[n], {n, 1, 70}];
%t A256660 h[0] = {1}; h[n_] := Join[h[n - 1], Table[b[n + 2], {k, 1, b[n]}]];
%t A256660 g = h[12];  r[0] = {0};
%t A256660 r[n_] := If[MemberQ[bb, n], {n}, Join[{g[[n]]}, -r[g[[n]] - n]]]
%t A256660 t = Table[Length[r[n]], {n, 0, 120}]  (* A256660 *)
%Y A256660 Cf. A000045, A256655.
%K A256660 nonn,easy
%O A256660 0,5
%A A256660 _Clark Kimberling_, Apr 08 2015