login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022964 a(n) = 8-n. 1

%I #15 Aug 07 2021 10:09:27

%S 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 -16,-17,-18,-19,-20,-21,-22,-23,-24,-25,-26,-27,-28,-29,-30,-31,-32,

%U -33,-34,-35,-36,-37,-38,-39,-40,-41,-42,-43,-44,-45,-46,-47,-48,-49,-50,-51

%N a(n) = 8-n.

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F G.f.: ( 8-9*x ) / ( (x-1)^2 ). - _R. J. Mathar_, Aug 26 2015

%t 8-Range[0,60] (* _Harvey P. Dale_, Apr 30 2019 *)

%o (Python) print([8-n for n in range(60)]) # _Michael S. Branicky_, Aug 07 2021

%K sign,easy

%O 0,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:22 EDT 2024. Contains 371767 sequences. (Running on oeis4.)