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 A267595 #33 Aug 07 2025 06:51:49
%S A267595 1,10,1111,111111,11111111,1111111111,111111111111,11111111111111,
%T A267595 1111111111111111,111111111111111111,11111111111111111111,
%U A267595 1111111111111111111111,111111111111111111111111,11111111111111111111111111,1111111111111111111111111111
%N A267595 Binary representation of the n-th iteration of the "Rule 173" elementary cellular automaton starting with a single ON (black) cell.
%C A267595 a(n) is an irregularly chopped version of row n in triangle A267594. - _R. J. Mathar_, Aug 07 2025
%H A267595 Robert Price, <a href="/A267595/b267595.txt">Table of n, a(n) for n = 0..1000</a>
%H A267595 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A267595 Stephen Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>, Wolfram Media, 2002; p. 55.
%H A267595 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A267595 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F A267595 Conjectures from _Colin Barker_, Jan 18 2016 and Apr 20 2019: (Start)
%F A267595 a(n) = 101*a(n-1)-100*a(n-2) for n>3.
%F A267595 G.f.: (1-91*x+201*x^2-100*x^3) / ((1-x)*(1-100*x)).
%F A267595 (End)
%t A267595 rule=173; rows=20; ca=CellularAutomaton[rule,{{1},0},rows-1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rows-k+1,rows+k-1}],{k,1,rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]]],{k,1,rows}] (* Binary Representation of Rows *)
%Y A267595 Cf. A267594, A267596, A099814.
%K A267595 nonn,easy,less
%O A267595 0,2
%A A267595 _Robert Price_, Jan 18 2016