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 A125116 #22 Dec 14 2024 10:51:38
%S A125116 1,32,417,3072,15585,60960,197057,550912,1374273,3127840,6602849,
%T A125116 13089792,24605217,44188704,76283265,127213568,205777537,323968032,
%U A125116 497842465,748559360,1103602017,1598210592,2277045057,3196102656
%N A125116 Number of 8 X 8 pandiagonal Franklin squares with magic sum 4n.
%H A125116 M. M. Ahmed, <a href="https://arxiv.org/abs/math/0405476">Algebraic Combinatorics of Magic Squares</a>, arXiv:math/0405476 [math.CO], 2004.
%H A125116 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (9,-36,84,-126,126,-84,36,-9,1).
%F A125116 a(n) = s^8/2293760 + s^7/71680 + s^6/3840 + s^5/320 + s^4/40 + 2*s^3/15 + 197*s^2/420 + 106*s/105 + 1 where s=4*n [Ahmed].
%F A125116 G.f.: -(x+1)^3*(x^2+10*x+1)^2 / (x-1)^9. - _Colin Barker_, Dec 10 2012
%F A125116 a(n) = A145217(n+1) - A145217(n-1). - _Peter Bala_, Dec 12 2024
%p A125116 a := proc(n) local s ; s :=4*n ; s^8/2293760+s^7/71680+s^6/3840+s^5/320+s^4/40+2*s^3/15+197*s^2/420+106*s/105+1 ; end: for n from 0 to 30 do printf("%d ",a(n)) ; od;
%t A125116 CoefficientList[((1 + x)^3*(1 + 10*x + x^2)^2)/(1 - x)^9 + O[x]^24, x] (* _Jean-François Alcover_, Dec 06 2017 *)
%Y A125116 Cf. A145217.
%K A125116 easy,nonn
%O A125116 0,2
%A A125116 _R. J. Mathar_, Jan 25 2007