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 A287794 #6 Aug 25 2024 13:08:56
%S A287794 0,1,2,3,4,5,6,7,8,9,8,7,6,5,4,3,2,1,2,3,4,5,6,7,8,9,10,9,8,7,6,5,4,3,
%T A287794 2,3,4,5,6,7,8,9,10,11,10,9,8,7,6,5,4,3,4,5,6,7,8,9,10,11,12,11,10,9,
%U A287794 8,7,6,5,4,5,6,7,8,9,10,11,12,13,12,11,10
%N A287794 Nine steps forward, eight steps back.
%H A287794 <a href="/index/Rec#order_18">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).
%F A287794 a(n) = Sum_{i=1..n} (-1)^floor((2*i-2)/17).
%F A287794 a(n) = a(n-1) + a(n-17) - a(n-18) for n > 17.
%p A287794 a:=n->add((-1)^floor((2*i-2)/17), i=1..n): seq(a(n), n=0..200);
%t A287794 Table[Sum[(-1)^Floor[(2 i - 2)/17], {i, n}], {n, 0, 100}]
%t A287794 LinearRecurrence[{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1},{0,1,2,3,4,5,6,7,8,9,8,7,6,5,4,3,2,1},100] (* _Harvey P. Dale_, Aug 25 2024 *)
%Y A287794 Cf. A008611 (one step back, two steps forward).
%Y A287794 Cf. A058207 (three steps forward, two steps back).
%Y A287794 Cf. A260644 (four steps forward, three steps back).
%Y A287794 Cf. A271800 (five steps forward, four steps back).
%Y A287794 Cf. A271859 (six steps forward, five steps back).
%Y A287794 Cf. A287655 (seven steps forward, six steps back).
%Y A287794 Cf. A287793 (eight steps forward, seven steps back).
%K A287794 nonn,easy
%O A287794 0,3
%A A287794 _Wesley Ivan Hurt_, May 31 2017