Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109454
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109454 Sum of non-Fibonacci numbers between successive Fibonacci numbers: {(F(n) +1),(F(n) +2), +...+ (F(n+1) -1)}. +0
1
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; listen)
OFFSET

0,5

FORMULA

a(n) = Fibonacci(n+2)*(Fibonacci(n-1)-1)/2, n>1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), 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: A085507 A121654 A036366 this_sequence A000640 A010919 A022029

Adjacent sequences: A109451 A109452 A109453 this_sequence A109455 A109456 A109457

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 06 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research