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 A117479 #9 Jan 05 2025 19:51:38 %S A117479 1,0,1,0,1,1,0,2,1,1,1,0,2,2,1,2,1,1,1,0,3,2,2,2,1,2,2,1,2,1,1,1,0,3, %T A117479 3,2,3,2,2,2,1,3,2,2,2,1,2,2,1,2,1,1,1,0,4,3,3,3,2,3,3,2,3,2,2,2,1,3, %U A117479 3,2,3,2,2,2,1,3,2,2,2,1,2,2,1,2,1,1,1,0,4 %N A117479 Number of zeros in the maximal Fibonacci bit-representation of n (A104326). %H A117479 J. L. Brown, Jr., <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/3-1/brown.pdf">A new characterization of the Fibonacci numbers</a>, Fibonacci Quarterly 3, no. 1 (1965) 1-8. %H A117479 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibrep.html">Using the Fibonacci numbers to represent whole numbers</a>. %e A117479 a(7) = 2 because A104326(7) = 1010 contains 2 zeros. %Y A117479 Cf. A112310, A102364, A104325, A104324, A104326. %K A117479 nonn %O A117479 0,8 %A A117479 _Casey Mongoven_, Mar 20 2006