Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107416
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107416 Triangle, read by rows: T(0,0) = 1, T(n,k) = F(n+1)*T(n-1,k) + T(n-1,k-1) where F(n+1) is the n+1th Fibonacci number. +0
1
1, 1, -1, 2, -3, 1, 6, -11, 6, -1, 30, -61, 41, -11, 1, 240, -518, 389, -129, 19, -1, 3120, -6974, 5575, -2066, 376, -32, 1, 65520, -149574, 124049, -48961, 9962, -1048, 53, -1, 2227680, -5151036, 4367240, -1788723, 387669, -45594, 2850, -87, 1 (list; graph; listen)
OFFSET

0,4

COMMENT

For n>0, the row sums are 0. For n>1, sum(k=0..n) 2^k*T(n,k) = 0. The first subdiagonal (1,-3,6,-11,19,...) is an alternating signed version of A001911 (Fibonacci numbers - 2). The first row is A003266 (product of Fibonacci numbers).

CROSSREFS

Adjacent sequences: A107413 A107414 A107415 this_sequence A107417 A107418 A107419

Sequence in context: A121748 A008275 A130534 this_sequence A105613 A135894 A130850

KEYWORD

sign

AUTHOR

Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), May 26 2005

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research