This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A374304 #10 Jul 26 2024 21:20:59
%S A374304 23,629,15134,323031,6428665,122523673,2267420832,41081096139,
%T A374304 732520397439,12900298930153,224940605616826,3890634712091201,
%U A374304 66843522591221500,1141958198925483582,19416047904038468727,328765736871514344297,5547125910154291613320
%N A374304 Number of growing self-avoiding walks with displacement n on a half-infinite strip of height 6 with a trapped endpoint.
%C A374304 A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and for which all neighbors of the endpoint are part of the walk, i.e., the endpoint is trapped. This sequence is about GSAWs on the grid graph of integer points (x,y) where x >= 0 and y is in {0,1,2,3,4,5}. The GSAW must start at the point (0,0). The displacement of a GSAW is the difference between the largest and smallext x-values that it reaches.
%H A374304 Jay Pantone, <a href="/A374304/a374304.txt">generating function</a>
%H A374304 Jay Pantone, Alexander R. Klotz, and Everett Sullivan, <a href="https://arxiv.org/abs/2407.18205">Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height.</a>, arXiv:2407.18205 [math.CO], 2024.
%F A374304 See Links section for generating function.
%e A374304 Five of the a(1) = 23 walks are:
%e A374304 *--* * * * * * * * * * * *--* *
%e A374304 | | | |
%e A374304 * * * *--* * *--* * * * * * * *
%e A374304 | | | | | | | |
%e A374304 * * * * * * * * * * * * * * *
%e A374304 | | | | | |
%e A374304 *--* * * * * *--* * *--* * * * *
%e A374304 | | | | | | |
%e A374304 * * * *--* * *--* * * * * * * *
%e A374304 | | | | |
%e A374304 * * * * * * *--* * *--* * *--* *
%Y A374304 Cf. A078528, A374303.
%K A374304 nonn
%O A374304 1,1
%A A374304 _Jay Pantone_, Jul 22 2024