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 A144609 #10 May 30 2025 15:37:28
%S A144609 0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,
%T A144609 1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,
%U A144609 1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1
%N A144609 Sturmian word of slope Pi.
%C A144609 A063438 seems to contain the run lengths of 1's. - _R. J. Mathar_, May 30 2025
%p A144609 Digits := 500 :
%p A144609 x :=1 ;
%p A144609 y :=0 ;
%p A144609 slop := Pi ;
%p A144609 printf("0,") ;
%p A144609 for n from 1 to 300 do
%p A144609 if evalf((y+1)/x-slop) > 0 then
%p A144609 x := x+1 ;
%p A144609 printf("0,") ;
%p A144609 else
%p A144609 y := y+1 ;
%p A144609 printf("1,") ;
%p A144609 end if;
%p A144609 end do: # _R. J. Mathar_, May 30 2025
%t A144609 christoffel[s_, M_] := Module[{n, x = 1, y = 0, ans = {0}}, Do[ If[y + 1 <= s*x, AppendTo[ans, 1]; y++, AppendTo[ans, 0]; x++], {n, 1, M}]; ans]; christoffel[Pi, 105] (* _Robert G. Wilson v_, Feb 02 2017, after _Jean-François Alcover_, Sep 19 2016, A274170 *)
%Y A144609 See A144595 for further details.
%Y A144609 Seems to be very similar to A070127. Is this a coincidence?
%Y A144609 Cf. A063438, A076539 (partial sums).
%K A144609 nonn
%O A144609 0,1
%A A144609 _N. J. A. Sloane_, Jan 13 2009