The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A155110 a(n) = 8*Fibonacci(2n+1). 3
 8, 16, 40, 104, 272, 712, 1864, 4880, 12776, 33448, 87568, 229256, 600200, 1571344, 4113832, 10770152, 28196624, 73819720, 193262536, 505967888, 1324641128, 3467955496, 9079225360, 23769720584, 62229936392, 162920088592, 426530329384, 1116670899560 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 Index entries for linear recurrences with constant coefficients, signature (3,-1). FORMULA a(n) = 8*A001519(n+1) = 8*A122367(n) = 8 *|A099496(n)|. a(n) == A154811(n+6) (mod 9). a(n) == A156551(n) (mod 10). a(n) = A153873(n) - A027941(n). G.f.: 8*(1 - x)/(1 - 3*x + x^2). - G. C. Greubel, Apr 21 2021 MAPLE A155110 := proc(n) 8*combinat[fibonacci](2*n+1) ; end: seq(A155110(n), n=0..50) ; # R. J. Mathar, Oct 06 2009 MATHEMATICA 8*Fibonacci[2*Range[0, 30]+1] (* G. C. Greubel, Apr 21 2021 *) PROG (Magma) [8*Fibonacci(2*n+1): n in [0..30]]; // Vincenzo Librandi, Aug 07 2011 (Sage) [8*fibonacci(2*n+1) for n in (0..30)] # G. C. Greubel, Apr 21 2021 CROSSREFS Cf. A001519, A027941, A099496, A122367, A153873, A154811, A156551. Sequence in context: A052207 A038578 A348925 * A245419 A266159 A022444 Adjacent sequences: A155107 A155108 A155109 * A155111 A155112 A155113 KEYWORD nonn,easy,less AUTHOR Paul Curtz, Jan 20 2009 EXTENSIONS Comments converted to formulas by R. J. Mathar, Oct 06 2009 STATUS approved

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

Last modified September 12 12:03 EDT 2024. Contains 375851 sequences. (Running on oeis4.)