The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212278 Number of adjacent pairs of zeros (possibly overlapping) in the representation of n in base of Fibonacci numbers (A014417). 1
 0, 0, 0, 1, 0, 2, 1, 0, 3, 2, 1, 1, 0, 4, 3, 2, 2, 1, 2, 1, 0, 5, 4, 3, 3, 2, 3, 2, 1, 3, 2, 1, 1, 0, 6, 5, 4, 4, 3, 4, 3, 2, 4, 3, 2, 2, 1, 4, 3, 2, 2, 1, 2, 1, 0, 7, 6, 5, 5, 4, 5, 4, 3, 5, 4, 3, 3, 2, 5, 4, 3, 3, 2, 3, 2, 1, 5, 4, 3, 3, 2, 3, 2, 1, 3, 2, 1, 1, 0, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS a(n) = 0 only if n = Fibonacci(k)-1. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10946 EXAMPLE A014417(5) = 1000, two pairs of adjacent zeros, so a(5) = 2. MAPLE F:= combinat[fibonacci]: b:= proc(n) option remember; local j;       if n=0 then 0     else for j from 2 while F(j+1)<=n do od;          b(n-F(j))+2^(j-2)       fi     end: a:= proc(n) local c, h, m, t;       c, t, m:= 0, 1, b(n);       while m>0 do         h:= irem(m, 2, 'm');         if h=t and h=0 then c:=c+1 fi;         t:=h       od; c     end: seq(a(n), n=0..150);  # Alois P. Heinz, May 18 2012 CROSSREFS Cf. A000045, A003714, A014417, A007895, A102364. Sequence in context: A096652 A322133 A274183 * A244215 A255325 A025654 Adjacent sequences:  A212275 A212276 A212277 * A212279 A212280 A212281 KEYWORD base,nonn AUTHOR Alex Ratushnyak, May 13 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 15 14:31 EDT 2021. Contains 343920 sequences. (Running on oeis4.)