The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A109438

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

A109438

a(n) = 5a(n-1) - 5a(n-2) + a(n-3) + 2*(-1)^(n+1), alternatively a(n) = 3a(n-1) + 3a(n-2) - a(n-3).
(history; published version)

#14 by Andrew Howroyd at Tue Mar 12 12:16:39 EDT 2024

STATUS

reviewed

approved

#13 by Michel Marcus at Tue Mar 12 12:14:51 EDT 2024

STATUS

proposed

reviewed

#12 by Robert C. Lyons at Tue Mar 12 11:48:27 EDT 2024

STATUS

editing

proposed

#11 by Robert C. Lyons at Tue Mar 12 11:48:25 EDT 2024

COMMENTS

Floretion Algebra Multiplication Program, FAMP Code: (-1)^(n)jbasejfor[ + .5'ii' + .5'kk' + .5'ij' + .5'ji' + .5'jk' + .5'kj'] 1vesfor = (-1,-1,-1,-1,)

PROG

Floretion Algebra Multiplication Program, FAMP Code: (-1)^(n)jbasejfor[ + .5'ii' + .5'kk' + .5'ij' + .5'ji' + .5'jk' + .5'kj'] 1vesfor = (-1, -1, -1, -1, )

STATUS

approved

editing

#10 by Harvey P. Dale at Tue Sep 07 11:37:18 EDT 2021

STATUS

editing

approved

#9 by Harvey P. Dale at Tue Sep 07 11:37:15 EDT 2021

MATHEMATICA

LinearRecurrence[{3, 3, -1}, {1, 5, 18}, 30] (* Harvey P. Dale, Sep 07 2021 *)

STATUS

approved

editing

#8 by Alois P. Heinz at Sun May 12 14:12:37 EDT 2019

STATUS

proposed

approved

#7 by Colin Barker at Sun May 12 13:43:08 EDT 2019

STATUS

editing

proposed

Discussion

Sun May 12

14:12

Alois P. Heinz: thanks

#6 by Colin Barker at Sun May 12 13:41:58 EDT 2019

FORMULA

From _a(n) = (-2*(-1)^n + (7-5*sqrt(3))*(2-sqrt(3))^n + (2+sqrt(3))^n*(7+5*sqrt(3))) / 12. - _Colin Barker_, May 12 2019: (Start)

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

a(n) = (-2*(-1)^n + (7-5*sqrt(3))*(2-sqrt(3))^n + (2+sqrt(3))^n*(7+5*sqrt(3))) / 12.

(End)

STATUS

proposed

editing

Discussion

Sun May 12

13:43

Colin Barker: Yes.

#5 by Colin Barker at Sun May 12 12:34:12 EDT 2019

STATUS

editing

proposed

Discussion

Sun May 12

12:45

Alois P. Heinz: the second g.f. is a duplicate of the first g.f.