Triangle T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 2, 0<=k<=2^(n-2)).

A057607

Triangle T(n,k) = number of binary n-tuples u having exactly k grandchildren, where a grandchild is a vector obtained by deleting any two coordinates of u (n >= 2, 0<=k<=2^(n-2)).

Terms

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

External references