OFFSET
0,3
COMMENTS
Invert((a(n)) gives (0, -1, 4, -10, 20, -35, ) = A000292 (with alternating signs).
Binomial(a(n)) gives (0, -1, 2, -2, 4, -7, 10) = A094686 (with alternating signs, from 2nd term).
Floretion Algebra Multiplication Program, FAMP Code: 2basei[C*F]; C = - .5'j + .5'k - .5j' + .5k' - 'ii' - .5'ij' - .5'ik' - .5'ji' - .5'ki'; F = + .5'i + .5'ii' + .5'ij' + .5'ik'
REFERENCES
C. Dement, Floretion Integer Sequences (work in progress).
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-4,-5,-4,-1).
FORMULA
a(n) + a(n+1) + a(n+2) = (-1)^n *A001906(n+2) = (-1)^n*F(2n+4).
a(n) + 3*a(n+1) + 3*a(n+2) + a(n+3) = ((-1)^(n+1))*A109961(n+2).
(|a(n)|) = A290890(n) for n >= 0, this being the p-INVERT of (1,2,3,4,...), where p(S) = 1 - S^2. - Clark Kimberling, Aug 21 2017
a(n) = -4*a(n-1) - 5*a(n-2) - 4*a(n-3) - a(n-4) for n > 3. - Colin Barker, May 11 2019
MATHEMATICA
-x/((x^2+x+1)*(x^2+3*x+1)) + O[x]^30 // CoefficientList[#, x]& (* Jean-François Alcover, Jun 15 2017 *)
PROG
(SageMath) [((lucas_number1(n, 3, 1)-lucas_number1(n, 1, 1)))/(-2) for n in range(1, 32)] # Zerinvary Lajos, Jul 06 2008
(PARI) concat(0, Vec(-x / ((1 + x + x^2)*(1 + 3*x + x^2)) + O(x^30))) \\ Colin Barker, May 11 2019
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Creighton Dement, Oct 13 2005
STATUS
approved