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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161762 Sum of all numbers from Fibonacci(n-1) to Fibonacci(n). 1
1, 1, 3, 5, 12, 26, 63, 153, 385, 979, 2520, 6524, 16965, 44225, 115479, 301833, 789412, 2065414, 5405235, 14147705, 37033701, 96946631, 253795248, 664421400, 1739440297, 4553853121, 11922044043, 31212157613, 81714232380, 213930221714 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

Fibonacci(0) to Fibonacci(10) are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. Hence a(1) = 0+1 = 1, a(2) = 1, a(3) = 1+2 = 3, a(6) = 5+6+7+8 = 26, a(8) = 13+14+15+16+17+18+19+20+21 = 153.

PROG

(MAGMA) [ &+[Fibonacci(n-1)..Fibonacci(n)]: n in [1..30] ]; [From Klaus Brockhaus, Jun 25 2009]

CROSSREFS

Cf. A000045 (Fibonacci numbers).

Sequence in context: A135019 A141685 A017921 * A005913 A056690 A066951

Adjacent sequences:  A161759 A161760 A161761 * A161763 A161764 A161765

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jun 18 2009

EXTENSIONS

Edited, corrected (a(2)=2 replaced by 1, a(13)=15310 replaced by 16965) and extended beyond a(13) by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 25 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 16 03:44 EST 2012. Contains 205860 sequences.