OFFSET
1,4
COMMENTS
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".
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 rows)
FORMULA
T(n, j) = T(n-1, j) + T(n-2, j) + T(n-3, j) for j < n.
T(n, n) = T(n-1, n-1) + T(n-2, n-2) + T(n-3, n-3).
G.f.: x*y/((1 - x - x^2 - x^3)*(1 - y*x - y^2*x^2 - y^3*x^3)). - Andrew Howroyd, Sep 24 2025
EXAMPLE
Triangle begins:
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;
...
T(7,3) = 14 = (8 + 4 + 2) = T(6,3) + T(5,3) + T(4,3).
PROG
(PARI) T(n)={my(v=vector(n)); for(n=1, n, v[n]=vector(n, k, if(k!=n, v[n-1][k] + if(k<n-1, v[n-2][k]) + if(k<n-2, v[n-3][k]), if(n<3, 1, v[n-1][1] + v[n-2][1] + if(n>3, v[n-3][1]))))); v} \\ Andrew Howroyd, Sep 24 2025
{ my(A=T(10)); for(i=1, #A, print(A[i])) }
(PARI) T(n)={[Vecrev(p) | p<-Vec(1/((1 - x - x^2 - x^3)*(1 - y*x - y^2*x^2 - y^3*x^3)) + O(x^n))]} \\ Andrew Howroyd, Sep 24 2025
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, May 24 2003
EXTENSIONS
a(37) onwards from Andrew Howroyd, Sep 24 2025
STATUS
approved
