Number of n-step self-avoiding walks on the Laves graph with no non-contiguous adjacencies.

Terms

a(0) =1a(1) =3a(2) =6a(3) =12a(4) =24a(5) =48a(6) =96a(7) =192a(8) =384a(9) =738a(10) =1446a(11) =2832a(12) =5544a(13) =10818a(14) =21138a(15) =40980a(16) =79848a(17) =155406a(18) =302526a(19) =587232a(20) =1141620a(21) =2214102a(22) =4300410a(23) =8340876a(24) =16188108a(25) =31368204a(26) =60840540a(27) =117858042a(28) =228471396a(29) =442435860