|
%I #18 Apr 01 2018 11:30:53
%S 1,8,40,144,417,1032,2272,4568,8545,15072,25320,40824,63553,95984,
%T 141184,202896,285633,394776,536680,718784,949729,1239480,1599456,
%U 2042664,2583841,3239600,4028584,4971624,6091905,7415136,8969728,10786976,12901249,15350184
%N Number of magical labelings of the octahedral graph of magic sum n.
%H Colin Barker, <a href="/A125198/b125198.txt">Table of n, a(n) for n = 0..1000</a>
%H M. M. Ahmed, <a href="http://arXiv.org/abs/math.CO/0405476">Algebraic Combinatorics of Magic Squares</a>, math.CO/0405476, p73.
%H R. P. Stanley, <a href="/A002721/a002721.pdf">Examples of Magic Labelings</a>, Unpublished Notes, 1973 [Cached copy, with permission]
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (6,-14,14,0,-14,14,-6,1).
%F G.f.: (1+2*x+6*x^2+2*x^3+x^4)/((1-x)^7*(1+x)). [Stanley] - _N. J. A. Sloane_, Jul 07 2014
%F From _Colin Barker_, Jan 13 2017: (Start)
%F a(n) = (15*(31+(-1)^n) + 1152*n + 1216*n^2 + 720*n^3 + 250*n^4 + 48*n^5 + 4*n^6) / 480.
%F a(n) = 6*a(n-1) - 14*a(n-2) + 14*a(n-3) - 14*a(n-5) + 14*a(n-6) - 6*a(n-7) + a(n-8) for n>7.
%F (End)
%p a := proc(r) local r2 ; r2 := r^6/120+r^5/10+25*r^4/48+3*r^3/2+38*r^2/15+12*r/5 ; if r mod 2 = 0 then r2+1 ; else r2+15/16 ; fi ; end: for n from 0 to 40 do printf("%d ",a(n)) ; od;
%t (1 + 2*x + 6*x^2 + 2*x^3 + x^4)/((1 - x)^7*(1 + x)) + O[x]^40 // CoefficientList[#, x]& (* _Jean-François Alcover_, Apr 01 2018 *)
%o (PARI) Vec((1+2*x+6*x^2+2*x^3+x^4)/((1-x)^7*(1+x)) + O(x^40)) \\ _Colin Barker_, Jan 13 2017
%K easy,nonn
%O 0,2
%A _R. J. Mathar_, Jan 25 2007
%E Stanley reference added by _N. J. A. Sloane_, Jul 07 2014
|
