This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Index entries for linear recurrences with constant coefficients, signature (1,1). FORMULA G.f. : (1+2*x-x^2)/(1-x-x^2). a(n) = a(n-1)+a(n-2) for n>2. a(2n) = A097134(n); a(2n+1) = 3*F(2n+1). a(n) = L(n+1)-F(n-1) for n>=1, where L=A000032 and F=A000045. - Paolo P. Lava, Sep 17 2015 MATHEMATICA Join[{1}, Table[3*Fibonacci[n], {n, 70}]] (* Vladimir Joseph Stephan Orlovsky, Feb 10 2012 *) PROG (PARI) a(n)=if(n, 3*finonacci(n), 1) \\ Charles R Greathouse IV, Oct 16 2015 CROSSREFS Cf. A000032, A000045. Essentially the same as A022086. Sequence in context: A050337 A299473 A022086 * A293677 A293679 A274498 Adjacent sequences:  A097132 A097133 A097134 * A097136 A097137 A097138 KEYWORD nonn,easy AUTHOR Paul Barry, Jul 26 2004 EXTENSIONS Definition rewritten by N. J. A. Sloane, Jan 24 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 00:30 EST 2018. Contains 318032 sequences. (Running on oeis4.)