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 A080513 #33 Aug 05 2025 13:27:15
%S A080513 1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,14,14,15,
%T A080513 15,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,
%U A080513 27,27,28,28,29,29,30,30,31,31,32,32,33,33,34,34,35,35
%N A080513 a(n) = round(n/2) + 1 = ceiling(n/2) + 1 = floor((n+1)/2) + 1.
%C A080513 Number of ON (black) cells in the n-th iteration of the "Rule 70" elementary cellular automaton starting with a single ON (black) cell.
%D A080513 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H A080513 Robert Price, <a href="/A080513/b080513.txt">Table of n, a(n) for n = 0..1000</a>
%H A080513 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A080513 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A080513 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A080513 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%H A080513 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A080513 From _Colin Barker_, Jan 14 2016: (Start)
%F A080513 a(n) = (2*n-(-1)^n+5)/4.
%F A080513 a(n) = a(n-1)+a(n-2)-a(n-3) for n>2.
%F A080513 G.f.: (1+x-x^2) / ((1-x)^2*(1+x)). (End)
%F A080513 a(n) = 1 + A110654(n). - _Philippe Deléham_, Nov 23 2016
%F A080513 a(n) = A008619(n+1) = A110654(n+2) = A110654(n)+1 = A004526(n+3) = A140106(n+5); a(n+2) = a(n) + 1 for all n >= 0. - _M. F. Hasler_, Feb 14 2019
%F A080513 a(n) = a(n-1)*a(n-2) - Sum_{i=0..n-3} a(i). - _Marc Morgenegg_, Oct 04 2019
%F A080513 E.g.f.: ((2 + x)*cosh(x) + (3 + x)*sinh(x))/2. - _Stefano Spezia_, Aug 05 2025
%t A080513 rule=70; 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[Total[catri[[k]]],{k,1,rows}] (* Number of Black cells in stage n *)
%o A080513 (PARI) a(n) = (2*n-(-1)^n+5)/4 \\ _Colin Barker_, Jan 14 2016
%o A080513 (PARI) Vec((1+x-x^2)/((1-x)^2*(1+x)) + O(x^100)) \\ _Colin Barker_, Jan 14 2016
%o A080513 (PARI) A080513(n)=n\/2+1 \\ _M. F. Hasler_, Feb 14 2019
%Y A080513 Cf. A110654, A266843.
%K A080513 nonn,easy
%O A080513 0,2
%A A080513 _Robert Price_, Jan 04 2016
%E A080513 Simpler definition from _M. F. Hasler_, Feb 14 2019