Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094586
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094586 Central numbers of the triangle T of all positive differences of distinct Fibonacci numbers. +0
2
1, 5, 16, 47, 131, 356, 953, 2529, 6676, 17567, 46135, 121016, 317201, 831053, 2176712, 5700303, 14926171, 39081404, 102323209, 267896585, 701380076, 1836265535, 4807451951, 12586147632, 32951083681, 86267253461, 225850919488 (list; graph; listen)
OFFSET

1,2

COMMENT

As T is also the triangle of sums of consecutive distinct Fibonacci numbers, a(n) is such a sum, namely F(n+1)+F(n+2)+...+F(2n).

FORMULA

a(n)=F(2n+2)-F(n+2)=T(2n-1, n), T as in A094585.

EXAMPLE

a(4)=F(10)-F(6)=55-8=47.

MATHEMATICA

Table[Sum[Fibonacci[n + i], {i, 1, n}], {n, 1, 27}] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 12 2009]

CROSSREFS

Cf. A000045, A094585.

Sequence in context: A055552 A086750 A086749 this_sequence A140336 A166868 A055144

Adjacent sequences: A094583 A094584 A094585 this_sequence A094587 A094588 A094589

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 13 2004

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research