This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A133776 #11 Apr 05 2020 21:24:30 %S A133776 0,0,1,2,1,1,3,2,2,2,4,2,2,3,2,2,2,5,4,4,3,2,3,3,4,3,3,3,6,3,3,4,3,3, %T A133776 3,5,4,4,3,2,3,3,4,3,3,3,7,6,6,5,4,5,5,5,4,4,3,2,4,4,5,4,4,4,6,5,5,4, %U A133776 3,4,4,5,4,4,4,8,4,4,5,4,4,4,6,5,5,4,3,4,4,5,4,4,4,7,6,6,5,4,5,5,5,4,4,3,2 %N A133776 Number of 0's in the maximal "phinary" (A130601) representation of n. %D A133776 Zeckendorf, E., Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège 41, 179-182, 1972. %H A133776 Casey Mongoven, <a href="/A133776/b133776.txt">Table of n, a(n) for n = 1..199</a> %H A133776 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/phigits.html">Using Powers of Phi to represent Integers</a>. %e A133776 A130601(7)=10101101, which has three 0's. So a(7)=3. %Y A133776 Cf. A133775, A130601. %K A133776 nonn %O A133776 1,4 %A A133776 _Casey Mongoven_, Sep 23 2007