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 A010079 #26 Jul 08 2025 01:28:59
%S A010079 1,16,104,344,792,1528,2632,4152,6200,8792,12072,16024,20824,26424,
%T A010079 33032,40568,49272,59032,70120,82392,96152,111224,127944,146104,
%U A010079 166072,187608,211112,236312,263640,292792,324232,357624,393464,431384,471912,514648,560152
%N A010079 Coordination sequence for net formed by holes in D_4 lattice.
%D A010079 M. O'Keeffe, Coordination sequences for lattices, Zeit. f. Krist., 210 (1995), 905-908.
%H A010079 Vincenzo Librandi, <a href="/A010079/b010079.txt">Table of n, a(n) for n = 0..1000</a>
%H A010079 M. O'Keeffe, <a href="http://dx.doi.org/10.1524/zkri.1995.210.12.905">Coordination sequences for lattices</a>, Zeit. f. Krist., 210 (1995), 905-908.
%H A010079 M. O'Keeffe, <a href="/A008527/a008527.pdf">Coordination sequences for lattices</a>, Zeit. f. Krist., 210 (1995), 905-908. [Annotated scanned copy]
%H A010079 <a href="/index/Da#D4">Index entries for sequences related to D_4 lattice</a>
%H A010079 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2,1,-4,1,2,-1).
%F A010079 a(n) = 2*(-4*(-1)^n+(3+(-1)^n)*n+6*n^3) for n>1. G.f.: -(8*x^7 -25*x^6 +2*x^5 -63*x^4 -124*x^3 -71*x^2 -14*x -1) / ((x-1)^4*(x+1)^2). - _Colin Barker_, Jul 07 2013
%p A010079 f := n-> if n mod 2 = 0 then 12*n^3+8*n-8 else 12*n^3+4*n+8; fi; #(for n>1).
%t A010079 CoefficientList[Series[-(8 x^7 - 25 x^6 + 2 x^5 - 63 x^4 - 124 x^3 - 71 x^2 - 14 x-1)/((x - 1)^4 (x + 1)^2), {x, 0, 50}], x] (* _Vincenzo Librandi_, Oct 15 2013 *)
%t A010079 LinearRecurrence[{2,1,-4,1,2,-1},{1,16,104,344,792,1528,2632,4152},40] (* _Harvey P. Dale_, Nov 08 2017 *)
%K A010079 nonn,easy
%O A010079 0,2
%A A010079 _N. J. A. Sloane_
%E A010079 More terms from _Colin Barker_, Jul 07 2013