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 A211010 #31 Jan 16 2023 08:12:42 %S A211010 0,1,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3, %T A211010 2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3, %U A211010 4,3,2,3,4,3,2,3,4,3,2,3,4,3,2,3,4,3 %N A211010 Value on the axis "x" of the endpoint of the structure of A211000 at n-th stage. %C A211010 For the values on the axis "y" see A211011. %C A211010 Also [0, 1] together with the absolute values of A131731. %H A211010 Paolo Xausa, <a href="/A211010/b211010.txt">Table of n, a(n) for n = 0..9999</a> %H A211010 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1). %F A211010 From _Colin Barker_, Sep 15 2013: (Start) %F A211010 a(n) = (6+(-i)^n+i^n)/2 where n > 1, i=sqrt(-1). %F A211010 a(n) = a(n-1) - a(n-2) + a(n-3) for n > 4. %F A211010 G.f.: -x*(x+1)*(2*x^2+1) / ((x-1)*(x^2+1)). (End) %t A211010 A211010[nmax_]:=PadRight[{0,1,2,3},nmax+1,{4,3,2,3}]; %t A211010 A211010[100] (* _Paolo Xausa_, Jan 06 2023 *) %Y A211010 Bisection of A211000. %Y A211010 Cf. A211011 (the y's in A211000). %Y A211010 Cf. A131731, A164358, A210838, A210841. %Y A211010 Cf. A211001, A211002, A211003, A211020, A211021, A211022. %K A211010 nonn,easy %O A211010 0,3 %A A211010 _Omar E. Pol_, Mar 30 2012