|
|
A196024
|
|
Odious Fibonacci numbers.
|
|
2
|
|
|
1, 2, 8, 13, 21, 55, 233, 1597, 4181, 28657, 121393, 196418, 317811, 1346269, 2178309, 3524578, 9227465, 165580141, 1134903170, 1836311903, 2971215073, 20365011074, 32951280099, 53316291173, 225851433717, 2504730781961, 6557470319842, 17167680177565, 27777890035288
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Intersection of A000069 (odious numbers) and A000045 (Fibonacci numbers).
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, ...
The k-th odious number is a Fibonacci number for k = 1, 2, 5, 7, 11, 28, 117, 799, 2091, ...
|
|
LINKS
|
|
|
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;
|
|
MATHEMATICA
|
Rest[Select[Fibonacci[Range[100]], OddQ[DigitCount[#, 2, 1]]&]] (* Harvey P. Dale, Oct 16 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|