|
|
A261397
|
|
a(n) = 3^n*Fibonacci(n).
|
|
1
|
|
|
0, 3, 9, 54, 243, 1215, 5832, 28431, 137781, 669222, 3247695, 15766083, 76527504, 371477259, 1803179313, 8752833270, 42487113627, 206236840311, 1001094543576, 4859415193527, 23588096472765, 114499026160038, 555789946734999, 2697861075645339, 13095692747551008, 63567827923461075
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 3*a(n-1) + 9*a(n-2), a(0)=0, a(1)=3. - G. C. Greubel, Aug 21 2015
E.g.f.: (1/(phi - 1/phi))*(e^(3*phi*x) - e^(3*x/phi)), where 2*phi = 1 + sqrt(5). - G. C. Greubel, Aug 21 2015
|
|
MATHEMATICA
|
RecurrenceTable[{a[0]== 0, a[1]== 3, a[n]== 3*a[n-1] + 9*a[n-2]}, a, {n, 50}] (* G. C. Greubel, Aug 21 2015 *)
|
|
PROG
|
(PARI) vector(30, n, n--; 3^n*fibonacci(n)) \\ Michel Marcus, Aug 21 2015
(PARI) concat(0, Vec(-3*x/(9*x^2+3*x-1) + O(x^30))) \\ Colin Barker, Sep 01 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|