Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Aug 28 2019 16:57:43
%S 3,6,7,10,16,19,15,30,47,56,21,50,95,146,174,28,77,170,311,471,561,36,
%T 112,280,586,1043,1562,1859,45,156,434,1015,2044,3564,5291,6292,55,
%U 210,642,1652,3682,7204,12363,18226,21658,66,275,915,2562,6230,13392,25623
%N Second (k=2) triangle of numbers related to totally asymmetric exclusion process (case alpha=1, beta=1).
%C This is the second floor (k=2) of a pyramid of numbers, called X(1,1,k=2,n,m) with n>=m+1>=2. One could use offset n>=1 and add a zero main diagonal.
%C The column sequences give for n>=m+1 and m=1..7: A000217, A005581, A024191, A115129, A115130, A115132, A115133.
%C The diagonal sequences give for M:=n-m=1..3: A071716, A071726, A115134.
%H W. Lang: <a href="/A115127/a115127.txt">First 10 rows.</a>
%F a(n,m)= b(n,m) + b(n-1,m) with b(n,m):=A115126(n,m) if n=m+1 (main diagonal), A115126(n,m) + a(n,-1,m) if n>m+1 (subdiagonals) and 0 if n<m+1.
%e [3];[6,7];[10,16,19];[15,30,47,56];...
%e Main diagonal (n-m=1) example: a(3,2)= 7 = 5 + 2 because
%e A115126(3,2)=5 and A115126(2,2)=2.
%e Subdiagonal (n-m>1) example: a(4,2)= 16 = 9 + 7 because
%e A115126(4,2)=9 and a(3,2)=7.
%Y Row sums give A115128.
%K nonn,easy,tabl
%O 2,1
%A _Wolfdieter Lang_, Jan 13 2006