Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.

A061709

Consider a (hollow) triangle with n cells on each edge, for a total of 3(n-1) cells if n>1, or 1 cell if n=1; a(n) is number of ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.

Terms

    a(0) =1a(1) =4a(2) =20a(3) =104a(4) =752a(5) =5600a(6) =44224a(7) =350592a(8) =2800384a(9) =22377984a(10) =178990080a(11) =1431721984a(12) =11453509632a(13) =91626496000a(14) =733009854464

External references