OFFSET
0,1
COMMENTS
Floretion Algebra Multiplication Program, 2ibasesumseq[5'i + .5i' + .5'ii' + .5'jj' + .5'kk' + .5e], sumtype: default (ver. f). Note: Due to FAMP's limited ability to handle large numbers, it is unclear if 2ibasesumseq and (a(n)) continue to coincide for large n.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,-1,3,-2,1,-2).
FORMULA
a(n) = 2*a(n-1) - a(n-2) + 3*a(n-3) - 2*a(n-4) + a(n-5) - 2*a(n-6) for n>5. - Colin Barker, May 15 2019
MATHEMATICA
LinearRecurrence[{2, -1, 3, -2, 1, -2}, {2, 5, 6, 14, 31, 59}, 40] (* Harvey P. Dale, Nov 28 2019 *)
PROG
(PARI) Vec((1 + x - x^2)*(2 - x + x^2 - x^3) / ((1 - x)*(1 - 2*x)*(1 + x^2)*(1 + x + x^2)) + O(x^40)) \\ Colin Barker, May 15 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Creighton Dement, Aug 14 2005
STATUS
approved