cp's OEIS Frontend

A196024 Odious Fibonacci numbers.

%I A196024 #29 May 05 2019 03:48:30
%S A196024 1,2,8,13,21,55,233,1597,4181,28657,121393,196418,317811,1346269,
%T A196024 2178309,3524578,9227465,165580141,1134903170,1836311903,2971215073,
%U A196024 20365011074,32951280099,53316291173,225851433717,2504730781961,6557470319842,17167680177565,27777890035288
%N A196024 Odious Fibonacci numbers.
%C A196024 Intersection of A000069 (odious numbers) and A000045 (Fibonacci numbers).
%C A196024 The k-th Fibonacci number is odious for k = 1, 2, 3, 6, 7, 10, 13, 17, 19, 23, 26, 27, 28, 30, 31, 32, 33, 35, 41, 45, ...
%C A196024 The k-th odious number is a Fibonacci number for k = 1, 2, 5, 7, 11, 28, 117, 799, 2091, ...
%H A196024 Harvey P. Dale, <a href="/A196024/b196024.txt">Table of n, a(n) for n = 1..1000</a>
%e A196024 8 is a Fibonacci number that equals 1000 in binary, which contains one (odd number) 1.
%p A196024 isA000069 := proc(n)
%p A196024         type(wt(n),'odd') ;
%p A196024 end proc:
%p A196024 for n from 1 to 300 do
%p A196024         F := combinat[fibonacci](n) ;
%p A196024         if isA000069(F) then printf("%d,",F) ; end if;
%p A196024 end do: # _R. J. Mathar_, Oct 15 2011
%t A196024 Rest[Select[Fibonacci[Range[100]],OddQ[DigitCount[#,2,1]]&]] (* _Harvey P. Dale_, Oct 16 2011 *)
%Y A196024 Cf. A000045, A000120, A007088, A004685.
%K A196024 nonn,base
%O A196024 1,2
%A A196024 _Kausthub Gudipati_, Sep 27 2011