Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3*T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0^n.
A118350
Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3*T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0^n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =1a(9) =0a(10) =1a(11) =3a(12) =6a(13) =1a(14) =0a(15) =1a(16) =4a(17) =13a(18) =7a(19) =1a(20) =0a(21) =1a(22) =5a(23) =21a(24) =42a(25) =8a(26) =1a(27) =0a(28) =1a(29) =6
External references
- oeis: A118350