Array T(n,k) read by antidiagonals: T(1,k) = 2^k-1 and recursively T(n,k) = T(n-1,k) + A000337(k-1), n,k >= 1.

A104746

Array T(n,k) read by antidiagonals: T(1,k) = 2^k-1 and recursively T(n,k) = T(n-1,k) + A000337(k-1), n,k >= 1.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =4a(5) =7a(6) =1a(7) =5a(8) =12a(9) =15a(10) =1a(11) =6a(12) =17a(13) =32a(14) =31a(15) =1a(16) =7a(17) =22a(18) =49a(19) =80a(20) =63a(21) =1a(22) =8a(23) =27a(24) =66a(25) =129a(26) =192a(27) =127a(28) =1a(29) =9

External references