Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082793 A tribonacci triangle in which the top two northeast and southeast diagonals consist of tribonacci numbers. +0
2
1, 1, 1, 2, 1, 2, 4, 2, 2, 4, 7, 4, 4, 4, 7, 13, 7, 8, 8, 7, 13, 24, 13, 14, 16, 14, 13, 24, 44, 24, 26, 28, 28, 26, 24, 44 (list; graph; listen)
OFFSET

1,4

COMMENT

Uses a Hosoya-like format except that the latter has the Fibonacci recursion. This triangle uses the tribonacci recursion such that every interior number can be obtained by adding the 3 previous numbers, on its diagonal.

REFERENCES

Thomas Koshy, <"Fibonacci and Lucas Numbers with Applications">John Wiley and Sons, 2001, Chapter 15, pages 187-195, "Hosoya's Triangle".

FORMULA

T(n, j) = T(n-1, j) + T(n-2, j) + T(n-3, j); (every interior number can be obtained by adding the three previous numbers, on its diagonal.)

EXAMPLE

T(7,3) = 14 = (8 + 4 + 2) = T(6,3) + T(5,3) + T(4,3).

CROSSREFS

Cf. A000073, tribonacci numbers, A058071, Hosoya's triangle.

Sequence in context: A082693 A097082 A145173 this_sequence A114929 A152251 A144025

Adjacent sequences: A082790 A082791 A082792 this_sequence A082794 A082795 A082796

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), May 24 2003

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