The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A131562

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A131562

a(n)= -3a(n-1) -3a(n-2)-2a(n-3), a(0)=1, a(1)=-2, a(2)=2.
(history; published version)

#13 by Hugo Pfoertner at Sun Sep 22 04:33:38 EDT 2024

STATUS

reviewed

approved

#12 by Joerg Arndt at Sun Sep 22 03:21:02 EDT 2024

STATUS

proposed

reviewed

#11 by Jason Yuen at Sun Sep 22 03:06:34 EDT 2024

STATUS

editing

proposed

#10 by Jason Yuen at Sun Sep 22 03:06:26 EDT 2024

FORMULA

O.g.f.: (1+x-x^2)/((1+2x2*x)*(1+x+x^2)). a(n)=(-1)^n*A130707(n). - R. J. Mathar, Jul 07 2008

KEYWORD

sign,easy

STATUS

approved

editing

#9 by Harvey P. Dale at Wed Jan 11 14:32:20 EST 2017

STATUS

editing

approved

#8 by Harvey P. Dale at Wed Jan 11 14:32:14 EST 2017

LINKS

Harvey P. Dale, <a href="/A131562/b131562.txt">Table of n, a(n) for n = 0..1000</a>

STATUS

approved

editing

#7 by Harvey P. Dale at Wed Jan 11 14:30:52 EST 2017

STATUS

editing

approved

#6 by Harvey P. Dale at Wed Jan 11 14:30:48 EST 2017

LINKS

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

MATHEMATICA

LinearRecurrence[{-3, -3, -2}, {1, -2, 2}, 40] (* Harvey P. Dale, Jan 11 2017 *)

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:51:52 EDT 2012

AUTHOR

_Paul Curtz (bpcrtz(AT)free.fr), _, Aug 27 2007

Discussion

Fri Mar 30

18:51

OEIS Server: https://oeis.org/edit/global/249

#4 by Russ Cox at Fri Mar 30 17:39:21 EDT 2012

FORMULA

O.g.f.: (1+x-x^2)/((1+2x)(1+x+x^2). a(n)=(-1)^n*A130707(n). - _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 07 2008

Binomial transform yields A130151 without the first two terms. - _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 07 2008

EXTENSIONS

Edited by _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jul 07 2008

Discussion

Fri Mar 30

17:39

OEIS Server: https://oeis.org/edit/global/190