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 A179250 #16 Feb 13 2021 01:09:37
%S A179250 10945,15126,16723,17333,17566,17655,17689,17702,17707,17709,17710,
%T A179250 21891,23488,24098,24331,24420,24454,24467,24472,24474,24475,26072,
%U A179250 26682,26915,27004,27038,27051,27056,27058,27059,27669,27902,27991
%N A179250 Numbers that have 10 terms in their Zeckendorf representation.
%C A179250 A007895(a(n)) = 10. - _Reinhard Zumkeller_, Mar 10 2013
%H A179250 Reinhard Zumkeller, <a href="/A179250/b179250.txt">Table of n, a(n) for n = 1..10000</a>
%e A179250 10945=6765+2584+987+377+144+55+21+8+3+1;
%e A179250 15126=10946+2584+987+377+144+55+21+8+3+1;
%e A179250 16723=10946+4181+987+377+144+55+21+8+3+1;
%p A179250 with(combinat): B := proc (n) local A, ct, m, j: A := proc (n) local i: for i while fibonacci(i) <= n do n-fibonacci(i) end do end proc: ct := 0: m := n: for j while 0 < A(m) do ct := ct+1: m := A(m) end do: ct+1 end proc: Q := {}: for i from fibonacci(21)-1 to 28500 do if B(i) = 10 then Q := `union`(Q, {i}) else end if end do: Q;
%t A179250 zeck = DigitCount[Select[Range[2*10^6], BitAnd[#, 2*#] == 0 &], 2, 1];
%t A179250 Position[zeck, 10] // Flatten (* _Jean-François Alcover_, Jan 30 2018 *)
%o A179250 (Haskell)
%o A179250 a179250 n = a179250_list !! (n-1)
%o A179250 a179250_list = filter ((== 10) . a007895) [1..]
%o A179250 -- _Reinhard Zumkeller_, Mar 10 2013
%Y A179250 Cf. A035517, A007895, A179242, A179243, A179244, A179245, A179246, A179247, A179248, A179249, A179251, A179252, A179253.
%K A179250 nonn,look
%O A179250 1,1
%A A179250 _Emeric Deutsch_, Jul 05 2010