OFFSET
1,2
COMMENTS
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
8 is a Fibonacci number that equals 1000 in binary, which contains one (odd number) 1.
MAPLE
isA000069 := proc(n)
type(wt(n), 'odd') ;
end proc:
for n from 1 to 300 do
F := combinat[fibonacci](n) ;
if isA000069(F) then printf("%d, ", F) ; end if;
end do: # R. J. Mathar, Oct 15 2011
MATHEMATICA
Rest[Select[Fibonacci[Range[100]], OddQ[DigitCount[#, 2, 1]]&]] (* Harvey P. Dale, Oct 16 2011 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Kausthub Gudipati, Sep 27 2011
STATUS
approved