login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105809 A Fibonacci-Pascal matrix. 2
1, 1, 1, 2, 2, 1, 3, 4, 3, 1, 5, 7, 7, 4, 1, 8, 12, 14, 11, 5, 1, 13, 20, 26, 25, 16, 6, 1, 21, 33, 46, 51, 41, 22, 7, 1, 34, 54, 79, 97, 92, 63, 29, 8, 1, 55, 88, 133, 176, 189, 155, 92, 37, 9, 1, 89, 143, 221, 309, 365, 344, 247, 129, 46, 10, 1, 144, 232, 364, 530, 674, 709, 591 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

Row sums are A027934, diagonal sums are A010049(n+1). Inverse is A105810.

FORMULA

Riordan array (1/(1-x-x^2), x/(1-x)); Number triangle T(n, k)=sum{j=0..n, binomial(n-j, k+j)}; T(n, 0)=A000045(n), T(n, m)=T(n-1, m-1)+T(n-1, m).

T(n,k)=sum{j=0..n, C(j,n+k-j)}; - Paul Barry (pbarry(AT)wit.ie), Oct 23 2006

EXAMPLE

Triangle begins

1;

1,1;

2,2,1;

3,4,3,1;

5,7,7,4,1;

CROSSREFS

Sequence in context: A061987 A182630 A179901 * A091594 A118032 A089692

Adjacent sequences:  A105806 A105807 A105808 * A105810 A105811 A105812

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 04 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.