Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144154
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144154 A Fibonacci triangle, row sums = A023610 +0
1
1, 2, 1, 3, 2, 2, 5, 3, 4, 5, 8, 5, 6, 6, 5, 13, 8, 10, 9, 10, 8, 21, 13, 16, 15, 15, 16, 13, 34, 21, 26, 24, 25, 24, 26, 21, 55, 34, 42, 39, 40, 40, 39, 42, 34 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Row sums = A023610: (1, 3, 7, 15, 30, 58,...).

FORMULA

The triangle as an infinite lower triangular matrix = A * B. A = a Fibonacci subsequences decrescendo triangle: (1; 2,1; 3,2,1; 5,3,2,1;...) and B = A127647, an infinite lower triangular matrix with the Fibonacci sequence as the main diagonal and the rest zeros.

EXAMPLE

First few rows of the triangle =

1;

2, 1;

3, 2, 2;

5, 3, 4, 3;

8, 5, 6, 6, 5;

13, 8, 10, 9, 10, 8;

21, 13, 16, 15, 15, 16, 13;

34, 21, 26, 24, 25, 24, 26, 21;

... Row 4 = (5, 3, 4, 3) = termwise products of (5, 3, 2, 1) and (1, 1, 2, 3).

CROSSREFS

A023610

Sequence in context: A137948 A120933 A064134 this_sequence A054710 A048233 A005679

Adjacent sequences: A144151 A144152 A144153 this_sequence A144155 A144156 A144157

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Sep 12 2008

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research