A105576 a(n) = 2*a(n-1) - 3*a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 4, a(2) = 0.

3, 4, 0, -6, -4, 10, 20, 2, -36, -38, 36, 114, 44, -182, -268, 98, 636, 442, -828, -1710, -52, 3370, 3476, -3262, -10212, -3686, 16740, 24114, -9364, -57590, -38860, 76322, 154044, 1402, -306684, -309486, 303884, 922858, 315092, -1530622, -2160804, 900442, 5222052, 3421170

Offset: 0

Author

Creighton Dement, Apr 14 2005

Keywords

• sign
• easy

Comments

Floretion Algebra Multiplication Program, FAMP Code: 1vesseq[.5'j + .5'k + .5j' + .5k' + .5'ii' + .5e]

Links

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

Crossrefs

Cf. A105577, A105578, A105579, A105580.

Equals 2*A107920(n) + A107920(n-1) + 1.

Programs

Mathematica

LinearRecurrence[{2,-3,2},{3,4,0},50] (* Harvey P. Dale, Jul 05 2022 *)

Formula

2*a(n) = A105225(n) + A105577(n) + 4*((-1)^n)*A001607(n+1)

G.f.: (3-2x+x^2)/((1-x)(1-x+2x^2)). a(n)=1+A107920(n)+2*A107920(n+1). [From R. J. Mathar, Feb 04 2009]