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 A131341 #11 Jul 05 2025 09:36:48
%S A131341 1,0,0,1,1,0,1,1,1,0,2,2,1,1,1,1,0,2,2,2,1,2,2,1,1,1,1,0,3,3,2,2,2,2,
%T A131341 1,2,2,2,1,2,2,1,1,1,1,0,3,3,3,2,3,3,2,2,2,2,1,3,3,2,2,2,2,1,2,2,2,1,
%U A131341 2,2,1,1,1,1,0,4,4,3,3,3,3,2,3,3,3,2,3
%N A131341 Number of 0's in maximal Lucas representation (A130311) of n.
%H A131341 Amiram Eldar, <a href="/A131341/b131341.txt">Table of n, a(n) for n = 1..10000</a>
%H A131341 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>.
%t A131341 lazy = Select[IntegerDigits[Range[400], 2], SequenceCount[#, {0, 0}] == 0 &]; t = Total[#*Reverse@LucasL[Range[0, Length[#] - 1]]] & /@ lazy; Plus @@@ (1 - lazy[[TakeWhile[Flatten[FirstPosition[t, #] & /@ Range[Max[t]]], NumberQ]]]) (* _Amiram Eldar_, Jul 05 2025 *)
%Y A131341 Cf. A131340, A000032, A102364.
%K A131341 nonn
%O A131341 1,11
%A A131341 _Casey Mongoven_, Jun 29 2007, corrected Mar 23 2008
%E A131341 More terms from _Amiram Eldar_, Jul 05 2025