T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1).

A207100

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1).

Terms

    a(0) =2a(1) =3a(2) =3a(3) =4a(4) =6a(5) =5a(6) =5a(7) =10a(8) =12a(9) =8a(10) =6a(11) =15a(12) =26a(13) =26a(14) =12a(15) =7a(16) =21a(17) =45a(18) =68a(19) =55a(20) =18a(21) =8a(22) =28a(23) =75a(24) =140a(25) =176a(26) =115a(27) =27a(28) =9a(29) =36

External references