proposed
approved
proposed
approved
editing
proposed
Vincenzo Librandi, <a href="/A056311/b056311.txt">Table of n, a(n) for n = 1..1000</a>
CoefficientList[Series[12 x^3 (3 x + 1) (8 x^4 - 3 x^3 - 2 x^2 - x + 1) / ((x - 1) (4 x - 1) (3 x - 1) (2 x + 1) (2 x - 1) (3 x^2 - 1) (2 x^2 - 1)), {x, 0, 33}], x] (* Vincenzo Librandi, Sep 26 2018 *)
proposed
editing
editing
proposed
Equals A032121(n) - 4*A032120(n) + 6*A005418(n+1) - 4.
G.f.: 12*x^4*(3*x+1)*(8*x^4-3*x^3-2*x^2-x+1)/ ((x-1) * (4*x-1) * (3*x-1) * (2*x+1) * (2*x -1) * (3*x^2-1) * (2*x^2-1)) [From . - Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009] [Corrected by R. J. Mathar, Sep 16 2009]
k=4; Table[(StirlingS2[i, k]+StirlingS2[Ceiling[i/2], k])k!/2, {i, k, 30}] (*_ _Robert A. Russell_, Nov 25 2017 *)
proposed
editing
editing
proposed
a(n) = k! (S2(n,k) + S2(ceiling(n/2),k)) / 2, where k=4 is the number of colors and S2 is the Stirling subset number. - Robert A. Russell, Sep 25 2018
For n=4, the 12 rows are 12 permutations of ABCD that do not include any mutual reversals. Each of the 12 chiral pairs, such as ABCD-DCBA, is then counted just once. - Robert A. Russell, Sep 25 2018
approved
editing
proposed
approved
editing
proposed