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 A244869 #19 Dec 06 2023 08:33:48
%S A244869 1,9,43,143,379,859,1738,3226,5597,9197,14453,21881,32095,45815,63876,
%T A244869 87236,116985,154353,200719,257619,326755,410003,509422,627262,765973,
%U A244869 928213,1116857,1335005,1585991,1873391,2201032,2573000,2993649,3467609,3999795,4595415,5259979,5999307,6819538
%N A244869 Number of magic labelings with magic sum n of first graph shown in link.
%H A244869 Colin Barker, <a href="/A244869/b244869.txt">Table of n, a(n) for n = 0..1000</a>
%H A244869 N. J. A. Sloane, <a href="/A244869/a244869.jpg">Graphs for A244869-A244876.</a>
%H A244869 R. P. Stanley, <a href="/A002721/a002721.pdf">Examples of Magic Labelings</a>, Unpublished Notes, 1973 [Cached copy, with permission]
%H A244869 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (5,-9,5,5,-9,5,-1).
%F A244869 G.f.: (1 + 4*x + 7*x^2 + 4*x^3 + x^4) / ((1 - x)^6*(1 + x)).
%F A244869 From _Colin Barker_, Jan 11 2017: (Start)
%F A244869 a(n) = (15*(63 + (-1)^n) + 2592*n + 2880*n^2 + 1660*n^3 + 510*n^4 + 68*n^5) / 960.
%F A244869 a(n) = 5*a(n-1) - 9*a(n-2) + 5*a(n-3) + 5*a(n-4) - 9*a(n-5) + 5*a(n-6) - a(n-7) for n>6.
%F A244869 (End)
%t A244869 LinearRecurrence[{5,-9,5,5,-9,5,-1},{1,9,43,143,379,859,1738},50] (* _Paolo Xausa_, Dec 06 2023 *)
%o A244869 (PARI) Vec((1+4*x+7*x^2+4*x^3+x^4) / ((1-x)^6*(1+x)) + O(x^40)) \\ _Colin Barker_, Jan 11 2017
%Y A244869 Cf. A244869-A244876.
%K A244869 nonn,easy
%O A244869 0,2
%A A244869 _N. J. A. Sloane_, Jul 08 2014