login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099012 3^(n-1)*Fibonacci(n). 15
0, 1, 3, 18, 81, 405, 1944, 9477, 45927, 223074, 1082565, 5255361, 25509168, 123825753, 601059771, 2917611090, 14162371209, 68745613437, 333698181192, 1619805064509, 7862698824255, 38166342053346, 185263315578333 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Binomial transform is A057088 (with leading 0). Partial sums are A099013. Binomial transform of A015447 (with leading 0).

FORMULA

G.f.: x/(1-3x-9x^2); a(n)=3a(n-1)+9a(n-2); a(n)=sqrt(5)(3/2+3sqrt(5)/2)^n/15-sqrt(5)(3/2-3sqrt(5)/2)^n/15.

MATHEMATICA

a[n_]:=(MatrixPower[{{1, 5}, {1, -4}}, n].{{1}, {1}})[[2, 1]]; Table[Abs[a[n]], {n, -1, 40}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 20 2010]

PROG

(Sage) [lucas_number1(n, 3, -9) for n in xrange(0, 23)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 22 2009]

(MAGMA) [3^(n-1)*Fibonacci(n): n in [0..60]]; // Vincenzo Librandi, Apr 23 2011

CROSSREFS

Cf. A000045.

Sequence in context: A036290 A078904 * A122069 A103897 A119424 A037295

Adjacent sequences:  A099009 A099010 A099011 * A099013 A099014 A099015

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Sep 22 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.