Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104582
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104582 Triangle read by rows: T(i,j) is the (i,j)-entry (1<=j<=i) of the product of the lower triangular matrix (fibonacci(i-j+1)) and of the lower triangular matrix all of whose entries are equal to 1 (for j<=i). +0
1
1, 2, 1, 4, 2, 1, 7, 4, 2, 1, 12, 7, 4, 2, 1, 20, 12, 7, 4, 2, 1, 33, 20, 12, 7, 4, 2, 1, 54, 33, 20, 12, 7, 4, 2, 1, 88, 54, 33, 20, 12, 7, 4, 2, 1, 143, 88, 54, 33, 20, 12, 7, 4, 2, 1, 232, 143, 88, 54, 33, 20, 12, 7, 4, 2, 1, 376, 232, 143, 88, 54, 33, 20, 12, 7, 4, 2, 1, 609, 376, 232 (list; table; graph; listen)
OFFSET

1,2

FORMULA

T(i, j)=fibonacci(i-j+3)-1 for 1<=j<=i and 0 otherwise. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 2005

EXAMPLE

The first few rows of the triangle are:

1;

2, 1;

4, 2, 1;

7, 4, 2, 1;

12, 7, 4, 2, 1;

...

MAPLE

with(combinat): for i from 1 to 13 do seq(fibonacci(i-j+3)-1, j=1..i) od; # yields sequence in triangular form (Deutsch)

CROSSREFS

Sum of row n = fibonacci(n+4)-n-3 (A001924). Columns (starting from the diagonal entries) are the Fibonacci numbers -1 (A000071).

Sequence in context: A059370 A084534 A165899 this_sequence A133938 A074586 A134586

Adjacent sequences: A104579 A104580 A104581 this_sequence A104583 A104584 A104585

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 16 2005

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research