login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022958 a(n) = 2 - n. 20
2, 1, 0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23, -24, -25, -26, -27, -28, -29, -30, -31, -32, -33, -34, -35, -36, -37, -38, -39, -40, -41, -42, -43, -44, -45, -46, -47, -48, -49, -50, -51, -52, -53, -54, -55 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..57.

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (2,-1).

FORMULA

From Paul Barry, Mar 31 2007: (Start)

G.f.: (2-3x)/(1-x)^2;

e.g.f.: exp(x)*(2-x). (End)

a(n) = 2*a(n-1) - a(n-2); a(0)=2, a(1)=1. - Philippe Deléham, Nov 03 2008

PROG

(PARI) a(n)=n-2 \\ Charles R Greathouse IV, Jun 11 2015

CROSSREFS

Sequence in context: A297158 A065358 A062329 * A023444 A248157 A290428

Adjacent sequences:  A022955 A022956 A022957 * A022959 A022960 A022961

KEYWORD

sign,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 09:38 EST 2020. Contains 338679 sequences. (Running on oeis4.)