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 A187165 #11 Mar 05 2022 22:11:44 %S A187165 0,96,1104,3984,9612,18888,32712,51984,77604,110472,151488,201552, %T A187165 261564,332424,415032,510288,619092,742344,880944,1035792,1207788, %U A187165 1397832,1606824,1835664,2085252,2356488,2650272,2967504,3309084,3675912,4068888 %N A187165 Number of 4-step self-avoiding walks on an n X n X n cube summed over all starting positions. %C A187165 Row 4 of A187162. %H A187165 R. H. Hardin, <a href="/A187165/b187165.txt">Table of n, a(n) for n = 1..50</a> %F A187165 Empirical: a(n) = 150*n^3 - 426*n^2 + 312*n - 48 for n>2. %F A187165 Conjectures from _Colin Barker_, Apr 20 2018: (Start) %F A187165 G.f.: 12*x^2*(8 + 60*x + 12*x^2 - 7*x^3 + 2*x^4) / (1 - x)^4. %F A187165 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>6. %F A187165 (End) %e A187165 A solution for 2 X 2 X 2: %e A187165 ..2..0.....3..4 %e A187165 ..1..0.....0..0 %Y A187165 Cf. A187162. %K A187165 nonn %O A187165 1,2 %A A187165 _R. H. Hardin_, Mar 06 2011