OFFSET
1,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).
FORMULA
a(n+1) = Sum_{k>=0} A030308(n,k)*b(k) with b(0)=1, b(1)=5, b(k)=7*2^(k-2) for k>1. - Philippe Deléham, Oct 19 2011
G.f.: x^2*(1+4*x+x^2+x^3) / ( (1+x)*(x^2+1)*(x-1)^2 ). - R. J. Mathar, Dec 03 2011
From Wesley Ivan Hurt, May 23 2016: (Start)
a(n) = a(n-1) + a(n-4) - a(n-5) for n>5.
a(n) = (14n-11-3*I^(2n)+(3-3*I)*I^(-n)+(3+3*I)*I^n)/8 where I=sqrt(-1).
E.g.f.: (4 - 3*sin(x) + 3*cos(x) + (7*x - 4)*sinh(x) + 7*(x - 1)*cosh(x))/4. - Ilya Gutkovskiy, May 24 2016
MAPLE
A047322:=n->(14*n-11-3*I^(2*n)+(3-3*I)*I^(-n)+(3+3*I)*I^n)/8: seq(A047322(n), n=1..100); # Wesley Ivan Hurt, May 23 2016
MATHEMATICA
Table[(14n-11-3*I^(2n)+(3-3*I)*I^(-n)+(3+3*I)*I^n)/8, {n, 80}] (* Wesley Ivan Hurt, May 23 2016 *)
LinearRecurrence[{1, 0, 0, 1, -1}, {0, 1, 5, 6, 7}, 60] (* Vincenzo Librandi, May 24 2016 *)
PROG
(Magma) [n : n in [0..150] | n mod 7 in [0, 1, 5, 6]]; // Wesley Ivan Hurt, May 23 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Wesley Ivan Hurt, May 23 2016
STATUS
approved