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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155110 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; internal format)
OFFSET

0,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

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).

MAPLE

A155110 := proc(n) 8*combinat[fibonacci](2*n+1) ; end: seq(A155110(n), n=0..50) ; # R. J. Mathar, Oct 06 2009

PROG

(MAGMA) [8*Fibonacci(2*n+1): n in [0..30]]; // Vincenzo Librandi, Aug 07 2011

CROSSREFS

Sequence in context: A108576 A052207 A038578 * A022444 A089828 A188825

Adjacent sequences:  A155107 A155108 A155109 * A155111 A155112 A155113

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jan 20 2009

EXTENSIONS

Comments converted to formulas - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 06 2009

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 14 00:47 EST 2012. Contains 205567 sequences.