|
%I #23 Oct 02 2023 20:52:48
%S 0,1,2,3,5,6,7,8,13,14,15,16,18,19,20,21,34,35,36,37,39,40,41,42,47,
%T 48,49,50,52,53,54,55,89,90,91,92,94,95,96,97,102,103,104,105,107,108,
%U 109,110,123,124,125,126,128,129,130,131,136,137,138,139,141,142,143,144
%N 0 and numbers representable as a sum of distinct odd-indexed Fibonacci numbers.
%H R. J. Mathar, <a href="/A062877/b062877.txt">Table of n, a(n) for n = 0..3071</a>
%H A. Karttunen, <a href="http://www.fq.math.ca/Papers1/42-1/quartkarttunen01_2004.pdf">On Pascal's Triangle Modulo 2 in Fibonacci Representation</a>, The Fibonacci Quarterly, Vol. 42, #1 (2004) pp. 38-46.
%e F_1 = 1,
%e F_3 = 2,
%e F_1 + F_3 = 3,
%e F_5 = 5,
%e F_5 + F_1 = 6,
%e F_5 + F_3 = 7,
%e F_5 + F_3 + F_1 = 8,
%e F_7 = 13, ...
%p with(combinat); [seq(A062877(j),j=0..265)]; A062877 := n -> add((floor(n/(2^i)) mod 2)*fibonacci((2*i)+1),i=0..floor_log_2(n+1));
%p floor_log_2 := proc(n) local nn,i; nn := n; for i from -1 to n do if(0 = nn) then RETURN(i); fi; nn := floor(nn/2); od; end;
%p # alternative
%p isA062877 := proc(n)
%p local fset,fidx,ps ;
%p if n = 0 then
%p return true;
%p end if;
%p fset := {} ;
%p for fidx from 1 by 2 do
%p if combinat[fibonacci](fidx) >n then
%p break;
%p end if;
%p fset := fset union {combinat[fibonacci](fidx)} ;
%p end do:
%p for ps in combinat[powerset](fset) do
%p if n = add(fidx,fidx=ps) then
%p return true;
%p end if;
%p end do:
%p return false;
%p end proc: # _R. J. Mathar_, Aug 22 2016
%t Take[Union[Total/@Subsets[Fibonacci[Range[1,20,2]]]],70](* _Harvey P. Dale_, Dec 21 2013 *)
%o (PARI) my(m=Mod('x,'x^2-3*'x+1)); a(n) = subst(lift(subst(Pol(binary(n)), 'x,m)), 'x,2); \\ _Kevin Ryde_, Nov 25 2020
%Y A062878 gives the positions of A050614(n) in this sequence. A062879 is bisection.
%Y A036796(n) - 1.
%Y Cf. A022290 (even-indexed Fibonaccis), A054204.
%K nonn
%O 0,3
%A _Antti Karttunen_, Jun 26 2001
|
