[go: up one dir, main page]

login
Revision History for A114647 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Expansion of (3 -4*x -3*x^2)/((1-x^2)*(1-2*x-x^2)); a Pellian-related sequence.
(history; published version)
#13 by Charles R Greathouse IV at Thu Sep 08 08:45:23 EDT 2022
PROG

(MAGMAMagma) I:=[3, 2, 7, 12]; [n le 4 select I[n] else 2*Self(n-1) +2*Self(n-2) -2*Self(n-3) -Self(n-4): n in [1..31]]; // G. C. Greubel, May 24 2021

Discussion
Thu Sep 08
08:45
OEIS Server: https://oeis.org/edit/global/2944
#12 by N. J. A. Sloane at Tue May 25 01:37:30 EDT 2021
STATUS

proposed

approved

#11 by G. C. Greubel at Mon May 24 15:26:47 EDT 2021
STATUS

editing

proposed

#10 by G. C. Greubel at Mon May 24 15:26:16 EDT 2021
NAME

Expansion of (-3+ -4*x+ -3*x^2)/((1-x^2)*(x+1)*(x^2+-2*x-1x^2)); a Pellian-related sequence.

FORMULA

G.f.: (3 -4*x -3*x^2)/((1-x)*(1+x)*(1-2*x-x^2)).

a(n) = A000129(n+1) + 2*A059841(n). - R. J. Mathar, Nov 10 2009

a(n) = (1 + (-1)^n + (-(1-+sqrt(2))^(1+n)+ - (1+-sqrt(2))^(1+n))/(2*sqrt(2))).

a(n) = 2*a(n-1) +2*a(n-2) -2*a(n-3) -a(n-4) for n>3. (End)

(End)

a(n) = A000129(n+1) + 1 + (-1)^n. - G. C. Greubel, May 24 2021

MATHEMATICA

Table[Fibonacci[n+1, 2] +1+(-1)^n, {n, 0, 30}] (* G. C. Greubel, May 24 2021 *)

PROG

(PARI) Vec((-3+-4*x+-3*x^2)/((1-x^2)*(x+1)*(x^2+-2*x-1x^2)) + O(x^50)) \\ Colin Barker, May 26 2016

(MAGMA) I:=[3, 2, 7, 12]; [n le 4 select I[n] else 2*Self(n-1) +2*Self(n-2) -2*Self(n-3) -Self(n-4): n in [1..31]]; // G. C. Greubel, May 24 2021

(Sage) [lucas_number1(n+1, 2, -1) +(1+(-1)^n) for n in (0..30)] # G. C. Greubel, May 24 2021

STATUS

approved

editing

#9 by Michel Marcus at Thu May 26 06:40:32 EDT 2016
STATUS

reviewed

approved

#8 by Joerg Arndt at Thu May 26 06:25:20 EDT 2016
STATUS

proposed

reviewed

#7 by Colin Barker at Thu May 26 05:55:56 EDT 2016
STATUS

editing

proposed

#6 by Colin Barker at Thu May 26 05:55:18 EDT 2016
DATA

3, 2, 7, 12, 31, 70, 171, 408, 987, 2378, 5743, 13860, 33463, 80782, 195027, 470832, 1136691, 2744210, 6625111, 15994428, 38613967, 93222358, 225058683, 543339720, 1311738123, 3166815962, 7645370047, 18457556052, 44560482151, 107578520350, 259717522851

LINKS

Colin Barker, <a href="/A114647/b114647.txt">Table of n, a(n) for n = 0..1000</a>

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

FORMULA

a(n) = A000129(n+1)+2*A059841(n). [From _- _R. J. Mathar_, Nov 10 2009]

From Colin Barker, May 26 2016: (Start)

a(n) = (1+(-1)^n+(-(1-sqrt(2))^(1+n)+(1+sqrt(2))^(1+n))/(2*sqrt(2))).

a(n) = 2*a(n-1)+2*a(n-2)-2*a(n-3)-a(n-4) for n>3.

(End)

PROG

(PARI) Vec((-3+4*x+3*x^2)/((1-x)*(x+1)*(x^2+2*x-1)) + O(x^50)) \\ Colin Barker, May 26 2016

STATUS

approved

editing

#5 by N. J. A. Sloane at Sun Jan 26 15:37:07 EST 2014
AUTHOR

_Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), _, Feb 18 2006

Discussion
Sun Jan 26
15:37
OEIS Server: https://oeis.org/edit/global/2101
#4 by Russ Cox at Fri Mar 30 17:39:08 EDT 2012
FORMULA

a(n) = A000129(n+1)+2*A059841(n). [From _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Nov 10 2009]

Discussion
Fri Mar 30
17:39
OEIS Server: https://oeis.org/edit/global/190