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 A095879 #19 Feb 07 2023 08:13:10 %S A095879 1,2,6,8,9,10,12,13,15,19,20,24,27,29,30,31,35,37,38,39,42,43,44,46, %T A095879 47,49,53,55,56,57,59,60,62,66,67,68,70,74,75,79,82,84,85,86,88,89,91, %U A095879 95,96,100,103,105,106,107,109,113,116,118,119,120,124,126,127,128,131,132 %N A095879 Numbers whose lazy Fibonacci representation has an odd number of summands. %H A095879 Amiram Eldar, <a href="/A095879/b095879.txt">Table of n, a(n) for n = 1..10000</a> %e A095879 The first few lazy Fibonacci representations (as in A095791) are 1=1, 2=2, 4=3+1, 5=3+2, 6=3+2+1, 7=5+2, 8=5+2+1, so a(1), a(2), a(3) and a(4) are 1, 2, 6 and 8, respectively. %Y A095879 Cf. A095880. %K A095879 nonn,base %O A095879 1,2 %A A095879 _Clark Kimberling_, Jun 10 2004