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 A118355 #13 Jan 06 2019 03:41:20 %S A118355 3,4,8,14,28,46,90,160,308,540,1032,1846,3502,6272,11852,21364,40234, %T A118355 72694,136564,247498,464070,842546,1577280,2868922,5364030,9769366, %U A118355 18245976,33272104,62086194,113326264,211304042,386039204,719319094,1315132086,2449100566 %N A118355 Number of self-avoiding walks on a honeycomb lattice with a one-dimensional impenetrable boundary. %C A118355 Bennett-Wood and Owczarek (1996) compute up to a(48). %H A118355 D. Bennett-Wood and A. L. Owczarek, <a href="http://dx.doi.org/10.1088/0305-4470/29/16/004">Exact enumeration results for self-avoiding walks on the honeycomb lattice attached to a surface</a>, J. Phys. A: Math. Gen., 29 (1996), 4755-4768. [See Table 1, p. 4761.] %e A118355 a(1)=3 because there are 3 directions on the lattice for the first step. %e A118355 a(2)=4 because two of these 3 first steps are already "repelled" by the boundary and only the third has two choices to proceed. %K A118355 nonn %O A118355 1,1 %A A118355 _R. J. Mathar_, May 14 2006 %E A118355 Terms a(26) to a(35) were copied from Table 1 (p. 4761) in Bennett-Wood and Owczarek (1996) by _Petros Hadjicostas_, Jan 05 2019