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 A177794 #24 Oct 03 2019 15:56:09
%S A177794 1,1,1,1,2,4,8,16,33,69,145,306,651,1398,3026,6590,14425,31720,70040,
%T A177794 155229,345193,770002,1722487,3863274,8685608,19570860,44188976,
%U A177794 99965361,226548082,514275345,1169255837,2662319778,6070294053,13858727891,31678845485
%N A177794 G.f. A satisfies -x+(1+x^3-x)*A+(x^4-x^2)*A^2+(x^5-x^3)*A^3-x^4*A^4 = 0.
%C A177794 Used in the enumeration of prudent self-avoiding walks.
%H A177794 Alois P. Heinz, <a href="/A177794/b177794.txt">Table of n, a(n) for n = 1..1000</a>
%H A177794 S. Gao, H. Niederhausen, <a href="http://math.fau.edu/Niederhausen/HTML/Papers/Sequences%20Arising%20From%20Prudent%20Self-Avoiding%20Walks-February%2001-2010.pdf">Sequences Arising From Prudent Self-Avoiding Walks</a>, (submitted to INTEGERS: The Electronic Journal of Combinatorial Number Theory).
%t A177794 m = 36; A[_] = 0;
%t A177794 Do[A[x_] = (x + A[x]^2*x^2 + A[x]^3*x^3 + A[x]^2*(-1 + A[x]^2)*x^4 - A[x]^3*x^5)/(1 - x + x^3) + O[x]^m, {m}];
%t A177794 CoefficientList[A[x]/x, x] (* _Jean-François Alcover_, Oct 03 2019 *)
%o A177794 (PARI) /* verification */
%o A177794 V177794=[1, 1, 1, 1, 2, 4, 8, 16, 33, 69, 145];
%o A177794 A=x*Ser(V177794); /* = x + x^2 + x^3 + x^4 + 2*x^5 + 4*x^6 + 8*x^7 + ... */
%o A177794 -x+(1+x^3-x)*A+(x^4-x^2)*A^2+(x^5-x^3)*A^3-x^4*A^4 /* = O(x^12) = "zero" */
%o A177794 /* _Joerg Arndt_, May 14 2011 */
%Y A177794 Cf. A178035.
%K A177794 nonn
%O A177794 1,5
%A A177794 This sequence was derived by Dr. Aaron Meyerowitz and submitted by _Shanzhen Gao_, May 13 2010