Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122070 Triangle T(n,k), 0<=k<=n, given by T(n,k)=Fibonacci(n+k+1)*binomial(n,k). +0
1
1, 1, 2, 2, 6, 5, 3, 15, 24, 13, 5, 32, 78, 84, 34, 8, 65, 210, 340, 275, 89, 13, 126, 510, 1100, 1335, 864, 233 (list; table; graph; listen)
OFFSET

0,3

FORMULA

T(n,k)=A000045(n+k+1)*A007318(n,k) . T(n,n)=Fibonacci(2*n+1)=A001519(n+1) . Sum_{k, 0<=k<=n}T(n,k)=Fibonacci(3*n+1)=A033887(n) . Sum_{k, 0<=k<=n}(-1)^k*T(n,k)=(-1)^n=A033999(n) . Sum_{k, 0<=k<=[n/2]}T(n-k,k)=(Fibonacci(n+1))^2=A007598(n+1).

EXAMPLE

Triangle begins:

1;

1, 2;

2, 6, 5;

3, 15, 24, 13;

5, 32, 78, 84, 34;

8, 65, 210, 340, 275, 89;

13, 126, 510, 1100, 1335, 864, 233;

CROSSREFS

Sequence in context: A064766 A121178 A019749 this_sequence A144160 A115255 A055924

Adjacent sequences: A122067 A122068 A122069 this_sequence A122071 A122072 A122073

KEYWORD

nonn,tabl

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 15 2006

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