

A097135


a(0) = 1; for n>0, a(n) = 3*Fibonacci(n).


4



1, 3, 3, 6, 9, 15, 24, 39, 63, 102, 165, 267, 432, 699, 1131, 1830, 2961, 4791, 7752, 12543, 20295, 32838, 53133, 85971, 139104, 225075, 364179, 589254, 953433, 1542687, 2496120, 4038807, 6534927, 10573734, 17108661, 27682395, 44791056, 72473451, 117264507
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Binomial transform is A097136.


LINKS

Table of n, a(n) for n=0..38.
Index to sequences with linear recurrences with constant coefficients, signature (1,1).


FORMULA

G.f. : (1+2xx^2)/(1xx^2); a(n)=a(n1)+a(n2), n>2; a(2n)=A097134; a(2n+1)=3F(2n+1).


MATHEMATICA

Join[{1}, Table[3*Fibonacci[n], {n, 70}]] (* Vladimir Joseph Stephan Orlovsky, Feb 10 2012 *)


CROSSREFS

Cf. A000045.
Essentially the same as A022086.
Sequence in context: A035528 A050337 A022086 * A167786 A167787 A185957
Adjacent sequences: A097132 A097133 A097134 * A097136 A097137 A097138


KEYWORD

easy,nonn,changed


AUTHOR

Paul Barry, Jul 26 2004


EXTENSIONS

Definition rewritten by N, J. A. Sloane, Jan 24 2010


STATUS

approved



