cp's OEIS Frontend

A271507 Number of self-avoiding walks of any length from NW to SW corners on an n X n grid or lattice.

%I A271507 #17 May 28 2021 19:11:21
%S A271507 1,2,11,178,8590,1246850,550254085,741333619848,3046540983075504,
%T A271507 38141694646516492843,1453908228148524205711098,
%U A271507 168707605740228097581729005751,59588304533380500951726150179910606,64061403305026776755367065417308840021540
%N A271507 Number of self-avoiding walks of any length from NW to SW corners on an n X n grid or lattice.
%t A271507 A271465 = Cases[Import["https://oeis.org/A271465/b271465.txt", "Table"], {_, _}][[All, 2]];
%t A271507 a[n_] := A271465[[2 n^2 - 2 n + 1]];
%t A271507 Table[a[n], {n, 1, 14}] (* _Jean-François Alcover_, Sep 23 2019 *)
%o A271507 (Python)
%o A271507 # Using graphillion
%o A271507 from graphillion import GraphSet
%o A271507 import graphillion.tutorial as tl
%o A271507 def A271507(n):
%o A271507     if n == 1: return 1
%o A271507     universe = tl.grid(n - 1, n - 1)
%o A271507     GraphSet.set_universe(universe)
%o A271507     start, goal = 1, n
%o A271507     paths = GraphSet.paths(start, goal)
%o A271507     return paths.len()
%o A271507 print([A271507(n) for n in range(1, 10)])  # _Seiichi Manyama_, Mar 21 2020
%Y A271507 Main diagonal of A271465.
%Y A271507 Cf. A007764, A000532, A001184, A145157, A120443, A003763.
%K A271507 nonn
%O A271507 1,2
%A A271507 _Andrew Howroyd_, Apr 08 2016