Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157897
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157897 Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k-1) + T(n-3,k-3) +0
2
1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 3, 1, 2, 0, 1, 4, 3, 3, 2, 0, 1, 5, 6, 5, 6, 0, 1, 1, 6, 10, 9, 12, 3, 3, 0, 1, 7, 15, 16, 21, 12, 6, 3, 0, 1, 8, 21, 27, 35, 30, 14, 12, 0, 1 (list; table; graph; listen)
OFFSET

0,8

COMMENT

Sum of n-th row = A000073(n+2). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 25 2009]

REFERENCES

Kenneth Edwards, "A Pascal-Like Triangle Related to the Tribonacci Numbers"; Fibonacci Quarterly, Volume 46/47, Number 1, February 2009.

FORMULA

Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k-1) + T(n-3,k-3), n>4.

EXAMPLE

First few rows of the triangle are:

1;

1, 0;

1, 1, 0;

1, 2, 0, 1;

1, 3, 1, 2, 0;

1, 4, 3, 3, 2, 0;

1, 5, 6, 5, 6, 0, 1;

1, 6, 10, 9, 12, 3, 3, 0;

1, 7, 15, 16, 21, 12, 6, 3, 0;

1, 8, 21, 27, 35, 30, 14, 12, 0, 1;

...

T(9,3) = 27 = T(8,3) + T(7,2) + T(6,0) = 16 + 10 + 1.

CROSSREFS

A120415, A006498

Sequence in context: A064922 A055186 A124035 this_sequence A140129 A029347 A058725

Adjacent sequences: A157894 A157895 A157896 this_sequence A157898 A157899 A157900

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 08 2009

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