A336662 - OEIS

%I #11 Jul 29 2020 18:45:17

%S 1,2,4,6,10,16,26,42,68,110,178,282,452,724,1160,1842,2936,4688,7480,

%T 11844,18826,29956,47658,75372,119540,189764,301212,475894,753568,

%U 1194126,1892172,2986994,4723940,7475398,11829270,18660876,29482630,46603432,73666540

%N Number of n-step self-avoiding walks on the Manhattan lattice with no non-contiguous adjacencies.

%C Adjacencies are forbidden regardless of the direction of the Manhattan lattice at the point in question.

%H Sean A. Irvine, <a href="/A336662/b336662.txt">Table of n, a(n) for n = 0..50</a>

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a336/A336662.java">Java program</a> (github)

%Y Cf. A117633 (without adjacency requirements), A173380 (square lattice).

%K nonn,walk

%O 0,2

%A _Sean A. Irvine_, Jul 28 2020