a(n) is the number of D3-symmetric patterns that may be formed with a top-down equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.

A060548

a(n) is the number of D3-symmetric patterns that may be formed with a top-down equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.

Terms

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

External references