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 A022964 #19 Jul 29 2024 03:03:34 %S A022964 8,7,6,5,4,3,2,1,0,-1,-2,-3,-4,-5,-6,-7,-8,-9,-10,-11,-12,-13,-14,-15, %T A022964 -16,-17,-18,-19,-20,-21,-22,-23,-24,-25,-26,-27,-28,-29,-30,-31,-32, %U A022964 -33,-34,-35,-36,-37,-38,-39,-40,-41,-42,-43,-44,-45,-46,-47,-48,-49,-50,-51 %N A022964 a(n) = 8-n. %H A022964 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A022964 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A022964 G.f.: ( 8-9*x ) / ( (x-1)^2 ). - _R. J. Mathar_, Aug 26 2015 %t A022964 8-Range[0,60] (* _Harvey P. Dale_, Apr 30 2019 *) %o A022964 (Python) print([8-n for n in range(60)]) # _Michael S. Branicky_, Aug 07 2021 %Y A022964 Cf. A022958 - A022995. %K A022964 sign,easy %O A022964 0,1 %A A022964 _N. J. A. Sloane_