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 A187170 #14 Mar 05 2022 22:12:08 %S A187170 0,0,167016,2013360,8227752,21274896,43422072,76964016,124223214, %T A187170 187527168,269203674,371580528,496985526,647746464,826191138, %U A187170 1034647344,1275442878,1550905536,1863363114,2215143408,2608574214,3045983328 %N A187170 Number of 9-step self-avoiding walks on an n X n X n cube summed over all starting positions. %C A187170 Row 9 of A187162. %H A187170 R. H. Hardin, <a href="/A187170/b187170.txt">Table of n, a(n) for n = 1..50</a> %F A187170 Empirical: a(n) = 387966*n^3 - 2452704*n^2 + 4766544*n - 2833872 for n>7. %F A187170 Conjectures from _Colin Barker_, Apr 21 2018: (Start) %F A187170 G.f.: 6*x^3*(27836 + 224216*x + 196068*x^2 - 37336*x^3 - 32904*x^4 + 4576*x^5 + 4625*x^6 + 836*x^7 + 49*x^8) / (1 - x)^4. %F A187170 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>11. %F A187170 (End) %Y A187170 Cf. A187162. %K A187170 nonn,walk %O A187170 1,3 %A A187170 _R. H. Hardin_, Mar 06 2011