login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A131738
a(0) = 0. a(n) = (n+1)*(-1)^n, n>0 .
2
0, -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, -56, 57, -58, 59, -60, 61, -62, 63, -64, 65, -66, 67, -68, 69, -70, 71, -72, 73, -74, 75
OFFSET
0,2
COMMENTS
Also the main diagonal of A138057.
FORMULA
From G. C. Greubel, Nov 02 2017: (Start)
a(n) = -2*a(n-1) - a(n-2).
G.f.: -x*(x+2)/(1+x)^2.
E.g.f.: (1 - x - exp(x))*exp(-x). (End)
MATHEMATICA
Join[{0}, Table[(-1)^n*(n + 1), {n, 1, 50}]] (* G. C. Greubel, Nov 02 2017 *)
LinearRecurrence[{-2, -1}, {0, -2, 3}, 80] (* Harvey P. Dale, Dec 03 2022 *)
PROG
(PARI) a(n)=if(n, (n+1)*(-1)^n, 0) \\ Charles R Greathouse IV, Sep 01 2015
(Magma) [0] cat [(-1)^n*(n+1): n in [1..50]]; // G. C. Greubel, Nov 02 2017
CROSSREFS
Cf. A105811.
Sequence in context: A114142 A020725 A119972 * A199969 A303502 A000027
KEYWORD
sign,easy
AUTHOR
Paul Curtz, Sep 19 2007
EXTENSIONS
Edited by R. J. Mathar, Jul 07 2008
STATUS
approved