Number of n-step self-avoiding walks on a 2D square lattice where the walk consists of three different units and each unit cannot be adjacent to another unit of the same type.

A337441

Number of n-step self-avoiding walks on a 2D square lattice where the walk consists of three different units and each unit cannot be adjacent to another unit of the same type.

Terms

    a(0) =1a(1) =4a(2) =12a(3) =28a(4) =68a(5) =164a(6) =396a(7) =956a(8) =2292a(9) =5420a(10) =12924a(11) =30812a(12) =73228a(13) =174228a(14) =413092a(15) =971900a(16) =2299244a(17) =5440924a(18) =12846900a(19) =30355228a(20) =71572196a(21) =167933164a(22) =395458372a(23) =931516756a(24) =2191050916a(25) =5156589252a(26) =12118552572a(27) =28383666716a(28) =66646232884a(29) =156526277324

External references