OFFSET
1,1
COMMENTS
A007895(a(n)) = 3. - Reinhard Zumkeller, Mar 10 2013
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
12 = 1+3+8;
17 = 1+3+13;
19 = 1+5+13;
20 = 2+5+13;
25 = 21+3+1;
MAPLE
with(combinat): B := proc (n) local A, ct, m, j: A := proc (n) local i: for i while fibonacci(i) <= n do n-fibonacci(i) end do end proc: ct := 0: m := n: for j while 0 < A(m) do ct := ct+1: m := A(m) end do: ct+1 end proc: Q := {}: for i from fibonacci(7)-1 to 160 do if B(i) = 3 then Q := `union`(Q, {i}) else end if end do: Q
MATHEMATICA
zeck = DigitCount[Select[Range[2000], BitAnd[#, 2*#] == 0 &], 2, 1];
Position[zeck, 3] // Flatten (* Jean-François Alcover, Jan 30 2018 *)
PROG
(Haskell)
a179243 n = a179243_list !! (n-1)
a179243_list = filter ((== 3) . a007895) [1..]
-- Reinhard Zumkeller, Mar 10 2013
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Emeric Deutsch, Jul 05 2010
STATUS
approved