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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109454 Sum of non-Fibonacci numbers between successive Fibonacci numbers: {(F(n) +1),(F(n) +2), +...+ (F(n+1) -1)}. 0
0, 0, 0, 0, 4, 13, 42, 119, 330, 890, 2376, 6291, 16588, 43615, 114492, 300236, 786828, 2061233, 5398470, 14136759, 37015990, 96917974, 253748880, 664346375, 1739318904, 4553656703, 11921726232, 31211643384, 81713400340, 213928875445 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Table of n, a(n) for n=0..29.

FORMULA

a(n) = Fibonacci(n+2)*(Fibonacci(n-1)-1)/2, n>1. - Vladeta Jovovic, Aug 27 2005

EXAMPLE

F(5) = F(4) +1 = 4.

F(6) = (F(5) +1)+( F(5) +2) = 6+7 = 13.

F(7) = 9+10+11+12 = 42.

CROSSREFS

Cf. A006002.

Sequence in context: A121654 A186202 A036366 * A000640 A199842 A192910

Adjacent sequences:  A109451 A109452 A109453 * A109455 A109456 A109457

KEYWORD

nonn,changed

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 27 2005

EXTENSIONS

More terms from Franklin T. Adams-Watters, Jun 06 2006

STATUS

approved

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 May 23 17:52 EDT 2013. Contains 225611 sequences.