|
Search: id:A109438
|
|
|
| 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). |
|
+0
2
|
|
| 1, 5, 18, 68, 253, 945, 3526, 13160, 49113, 183293, 684058, 2552940, 9527701, 35557865, 132703758, 495257168, 1848324913, 6898042485, 25743845026, 96077337620, 358565505453, 1338184684193, 4994173231318, 18638508241080
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
See A109437 for comments.
|
|
FORMULA
|
G.f. (1+2*x)/((x+1)*(x^2-4*x+1))
|
|
PROGRAM
|
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, )
|
|
CROSSREFS
|
Cf. A109437, A001834, A102871.
Sequence in context: A153373 A166677 A158879 this_sequence A164051 A134764 A145780
Adjacent sequences: A109435 A109436 A109437 this_sequence A109439 A109440 A109441
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jun 28 2005
|
|
|
Search completed in 0.002 seconds
|
