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 A301647 #13 Feb 16 2025 08:33:53
%S A301647 0,8,26,64,124,216,342,512,728,1000,1330,1728,2196,2744,3374,4096,
%T A301647 4912,5832,6858,8000,9260,10648,12166,13824,15624,17576,19682,21952,
%U A301647 24388,27000,29790,32768,35936,39304,42874,46656,50652,54872,59318,64000,68920,74088,79506,85184,91124
%N A301647 a(n) = n^3 - (n mod 2).
%C A301647 a(n) is the circumference of the n X n X n grid graph for n > 1.
%H A301647 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphCircumference.html">Graph Circumference</a>
%H A301647 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%H A301647 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3, -2, -2, 3, -1).
%F A301647 a(n) = (2 n^3 + (-1)^n - 1)/2.
%F A301647 a(n) = 3*a(n-1) - 2*a(n-2) - 2*a(n-3) + 3*a(n-4) - a(n-5).
%F A301647 G.f.: 2*x^2*(4 + x + x^2)/((-1 + x)^4*(1 + x)).
%p A301647 seq(n^3-modp(n,2), n=1..50); # _Muniru A Asiru_, Mar 25 2018
%t A301647 Table[n^3 - Mod[n, 2], {n, 20}]
%t A301647 Table[(2 n^3 + (-1)^n - 1)/2, {n, 20}]
%t A301647 LinearRecurrence[{3, -2, -2, 3, -1}, {0, 8, 26, 64, 124}, 20]
%t A301647 CoefficientList[Series[2 x (4 + x + x^2)/((-1 + x)^4 (1 + x)), {x, 0, 20}], x]
%o A301647 (GAP) List([1..50],n->n^3- n mod 2); # _Muniru A Asiru_, Mar 25 2018
%o A301647 (PARI) a(n) = n^3 - (n%2); \\ _Altug Alkan_, Mar 25 2018
%Y A301647 Cf. A137932 (circumference of n X n grid graph).
%K A301647 nonn,easy
%O A301647 1,2
%A A301647 _Eric W. Weisstein_, Mar 25 2018