|
|
|
|
5, 7, 9, 7, -15, -113, -471, -1673, -5535, -17633, -54951, -168953, -515055, -1561553, -4717431, -14217833, -42784575, -128615873, -386371911, -1160164313, -3482590095, -10451964593, -31364282391, -94109624393, -282362427615, -847154391713, -2541597392871, -7625060614073
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
REFERENCES
|
G. S. Lueker, Some techniques for solving recurrences, Computing Surveys, 12 (1980), 419-436.
|
|
LINKS
|
|
|
FORMULA
|
a(0)=5, a(1)=7, a(2)=9, a(n)=6*a(n-1)-11*a(n-2)+6*a(n-3). - Harvey P. Dale, Sep 23 2012
|
|
MATHEMATICA
|
Table[2+4*2^n-3^n, {n, 0, 30}] (* or *) LinearRecurrence[{6, -11, 6}, {5, 7, 9}, 30] (* Harvey P. Dale, Sep 23 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|