Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122491 a(n) = n*Fib(n) - sum_{i=0..n} Fib(i). +0
1
0, 0, 0, 2, 5, 13, 28, 58, 114, 218, 407, 747, 1352, 2420, 4292, 7554, 13209, 22969, 39748, 68494, 117590, 201210, 343275, 584087, 991440, 1679208, 2838408, 4789058, 8066669, 13566373, 22782892, 38209762, 64003002, 107083610, 178967807, 298803459, 498404504 (list; graph; listen)
OFFSET

0,4

FORMULA

a(n) = n*Fibonacci(n) - Fibonacci(n+2) + 1 - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 22 2008

EXAMPLE

a(5) = 13 because Fib(5) = 5, times 5 = 25 and subtract sum(Fib(5))=12 to get 13

MAPLE

with(combinat, fibonacci): for i from 1 to 30 do i*fibonacci(i) - sum(fibonacci(k), k=0..i); end do;

MATHEMATICA

Table[n*Fibonacci[n] - Fibonacci[n + 2] + 1, {n, 0, 40}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 22 2008

CROSSREFS

Cf. A000045.

Sequence in context: A065301 A126656 A026522 this_sequence A002559 A049097 A045366

Adjacent sequences: A122488 A122489 A122490 this_sequence A122492 A122493 A122494

KEYWORD

nonn

AUTHOR

Ben Thurston (benthurston27(AT)yahoo.com), Sep 16 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 17 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research