Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100492
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100492 Triangle read by rows giving the coefficients of general sum formulae of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies F(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k) / (n-1)!. +0
8
1, -1, -4, -3, 10, 49, 95, 83, 27, -90, -740, -2415, -4110, -3890, -1950, -405, 1320, 14054, 64116, 164059, 258461, 257604, 159070, 55755, 8505, -23640, -318684, -1881532, -6452300, -14294605, -21442540, -22106669, -15496012, -7078575, -1905120, -229635, 523440, 8474100, 61424596 (list; table; graph; listen)
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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research