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 A187166 #11 Apr 20 2018 14:38:43 %S A187166 0,144,3240,14256,37470,77184,137754,223536,338886,488160,675714, %T A187166 905904,1183086,1511616,1895850,2340144,2848854,3426336,4076946, %U A187166 4805040,5614974,6511104,7497786,8579376,9760230,11044704,12437154,13941936,15563406 %N A187166 Number of 5-step self-avoiding walks on an n X n X n cube summed over all starting positions. %C A187166 Row 5 of A187162. %H A187166 R. H. Hardin, <a href="/A187166/b187166.txt">Table of n, a(n) for n = 1..50</a> %F A187166 Empirical: a(n) = 726*n^3 - 2640*n^2 + 2688*n - 720 for n>3. %F A187166 Conjectures from _Colin Barker_, Apr 20 2018: (Start) %F A187166 G.f.: 6*x^2*(24 + 444*x + 360*x^2 - 115*x^3 + 4*x^4 + 9*x^5) / (1 - x)^4. %F A187166 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>7. %F A187166 (End) %e A187166 A solution for 2 X 2 X 2: %e A187166 ..5..0.....4..1 %e A187166 ..0..0.....3..2 %Y A187166 Cf. A187162. %K A187166 nonn,walk %O A187166 1,2 %A A187166 _R. H. Hardin_, Mar 06 2011