A196024 - OEIS

%I #29 May 05 2019 03:48:30

%S 1,2,8,13,21,55,233,1597,4181,28657,121393,196418,317811,1346269,

%T 2178309,3524578,9227465,165580141,1134903170,1836311903,2971215073,

%U 20365011074,32951280099,53316291173,225851433717,2504730781961,6557470319842,17167680177565,27777890035288

%N Odious Fibonacci numbers.

%C Intersection of A000069 (odious numbers) and A000045 (Fibonacci numbers).

%C 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 The k-th odious number is a Fibonacci number for k = 1, 2, 5, 7, 11, 28, 117, 799, 2091, ...

%H Harvey P. Dale, <a href="/A196024/b196024.txt">Table of n, a(n) for n = 1..1000</a>

%e 8 is a Fibonacci number that equals 1000 in binary, which contains one (odd number) 1.

%p isA000069 := proc(n)

%p         type(wt(n),'odd') ;

%p end proc:

%p for n from 1 to 300 do

%p         F := combinat[fibonacci](n) ;

%p         if isA000069(F) then printf("%d,",F) ; end if;

%p end do: # _R. J. Mathar_, Oct 15 2011

%t Rest[Select[Fibonacci[Range[100]],OddQ[DigitCount[#,2,1]]&]] (* _Harvey P. Dale_, Oct 16 2011 *)

%Y Cf. A000045, A000120, A007088, A004685.

%K nonn,base

%O 1,2

%A _Kausthub Gudipati_, Sep 27 2011