Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139147
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139147 Triangle read by rows: replace A003983(n,k) with F(n). +0
5
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 3, 3, 2, 1, 1, 1, 1, 2, 3, 5, 3, 2, 1, 1, 1, 1, 2, 3, 5, 5, 3, 2, 1, 1, 1, 1, 2, 3, 5, 8, 5, 3, 2, 1, 1, 1, 1, 2, 3, 5, 8, 8, 5, 3, 2, 1, 1 (list; table; graph; listen)
OFFSET

1,13

FORMULA

Replace term A003983(n,k) with F(n).

Triangle T(n,k)=sum{j=0..n, [j<=k]*[j<=n-k]*(F(j+1)-F(j))}. [From Paul Barry (pbarry(AT)wit.ie), Jan 18 2009]

EXAMPLE

First few rows of A003983 are [1; 1,1; 1,2,1; 1,2,2,1;...] which become [F(1); F(1),F(1); F(1),F(2),F(1); F(1),F(2),F(2),F(1);...] =

1;

1, 1;

1, 1, 1;

1, 1, 1, 1;

1, 1, 2, 1, 1;

1, 1, 2, 2, 1, 1;

1, 1, 2, 3, 2, 1, 1;

1, 1, 2, 3, 3, 2, 1, 1;

1, 1, 2, 3, 5, 3, 2, 1, 1;

1, 1, 2, 3, 5, 5, 3, 2, 1, 1;

1, 1, 2, 3, 5, 8, 5, 3, 2, 1, 1;

...

CROSSREFS

Cf. A134404.

Sequence in context: A163100 A139038 A139040 this_sequence A055801 A155050 A140356

Adjacent sequences: A139144 A139145 A139146 this_sequence A139148 A139149 A139150

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson & Klaus Breyer (qntmpkt(AT)yahoo.com), Apr 10 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research