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 A136640 #16 Feb 16 2025 08:33:07
%S A136640 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,4,9,
%T A136640 13,16,18,20,22,24,26,28,29,31,33,34,36,37,39,40,41,43,44,46,47,49,50,
%U A136640 51,51,53,54,56,58,58,60,61,63,65,67,67,67,67,67,67,70,72,73,75,76,77,79
%N A136640 A limited integer Devil's staircase from a winding number function.
%C A136640 Designed to be integer and 200 in length, this function is a limited representation of a Devil's staircase function; a projection of a set of rational numbers onto the integers.
%H A136640 Per Bak, <a href="http://adsabs.harvard.edu/abs/1982RPPh...45..587B">Commensurate phases, incommensurate phases and the devil's staircase</a>, Rep. Prog. Phys. 45 (1982) pp.587-629.
%H A136640 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DevilsStaircase.html">Devil's Staircase</a>.
%F A136640 a(n) = floor(1+200*Winding_Number(Omega)): 0<=omega<=1;in steps of 1/200
%t A136640 f[{omega_,t_}]:={omega,t+omega-Sin[2Pi t]/(2Pi)}; WindingNumber[n_,{omega_,t_}]:=(Nest[f,{omega,t},n][[2]]-t)/n; a=Table[Floor[1+200*WindingNumber[1000,{omega,0}]], {omega,0,1,.005}]
%K A136640 nonn,less,uned
%O A136640 1,33
%A A136640 _Roger L. Bagula_, Apr 01 2008