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 A187164 #13 Mar 05 2022 22:11:36 %S A187164 0,48,342,1056,2370,4464,7518,11712,17226,24240,32934,43488,56082, %T A187164 70896,88110,107904,130458,155952,184566,216480,251874,290928,333822, %U A187164 380736,431850,487344,547398,612192,681906,756720,836814,922368,1013562,1110576 %N A187164 Number of 3-step self-avoiding walks on an n X n X n cube summed over all starting positions. %C A187164 Row 3 of A187162. %H A187164 R. H. Hardin, <a href="/A187164/b187164.txt">Table of n, a(n) for n = 1..50</a> %F A187164 Empirical: a(n) = 30*n^3 - 60*n^2 + 24*n for n>1. %F A187164 Conjectures from _Colin Barker_, Apr 20 2018: (Start) %F A187164 G.f.: 6*x^2*(8 + 25*x - 4*x^2 + x^3) / (1 - x)^4. %F A187164 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>5. %F A187164 (End) %e A187164 A solution for 2 X 2 X 2: %e A187164 ..0..0.....0..0 %e A187164 ..1..2.....0..3 %Y A187164 Cf. A187162. %K A187164 nonn %O A187164 1,2 %A A187164 _R. H. Hardin_, Mar 06 2011