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 A244866 #11 Nov 09 2022 13:36:22
%S A244866 1,18,114,438,1263,3024,6356,12132,21501,35926,57222,87594,129675,
%T A244866 186564,261864,359720,484857,642618,839002,1080702,1375143,1730520,
%U A244866 2155836,2660940,3256565,3954366,4766958,5707954,6792003,8034828,9453264,11065296,12890097,14948066,17260866,19851462,22744159
%N A244866 Let G denote the 7-node, 12-edge graph formed from a hexagon with main diagonals drawn and a node at the center; a(n) = number of magic labelings of G with magic sum 2n.
%H A244866 Colin Barker, <a href="/A244866/b244866.txt">Table of n, a(n) for n = 0..1000</a>
%H A244866 R. P. Stanley, <a href="/A002721/a002721.pdf">Examples of Magic Labelings</a>, Unpublished Notes, 1973 [Cached copy, with permission]
%H A244866 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).
%F A244866 G.f.: (1 + 12*x + 21*x^2 + 4*x^3) / (1 - x)^6.
%F A244866 From _Colin Barker_, Jan 11 2017: (Start)
%F A244866 a(n) = (n + 1)*(n + 2)*(19*n^3 + 63*n^2 + 68*n + 30) / 60.
%F A244866 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>5.
%F A244866 (End)
%t A244866 LinearRecurrence[{6,-15,20,-15,6,-1},{1,18,114,438,1263,3024},40] (* _Harvey P. Dale_, Nov 09 2022 *)
%o A244866 (PARI) Vec((1 + 12*x + 21*x^2 + 4*x^3) / (1 - x)^6 + O(x^40)) \\ _Colin Barker_, Jan 11 2017
%K A244866 nonn,easy
%O A244866 0,2
%A A244866 _N. J. A. Sloane_, Jul 07 2014