%I #49 Jun 10 2024 14:21:14
%S 2,3,8,18,48,116,312,810,2184,5880,16104,44220,122640,341484,956576,
%T 2690010,7596480,21522228,61171656,174336264,498111952,1426403748,
%U 4093181688,11767874940,33891544368,97764009000,282429535752,817028131140,2366564736720
%N Dimensions of primitive Lie algebras connected with the Mantaci-Reutenauer algebra MR^(2).
%C Maybe the definition should say: "Number of generators of degree n ...". The paper is a little unclear.
%C From _Petros Hadjicostas_, Jun 18 2019: (Start)
%C An unmarked cyclic composition of n >= 1 is an equivalence class of ordered partitions of n such that two such ordered partitions are equivalent iff one can be obtained from the other by rotation.
%C Here, a(n) is the number of aperiodic unmarked cyclic compositions of n where up to two colors can be used.
%C It is also the CHK (circular, identity, unlabeled) transform of the sequence 2, 2, 2, ... See the link by Bowers about such transforms.
%C If c = (c(n): n >= 1) is the input sequence with g.f. C(x) = Sum_{n >= 1} c(n)*x^n, then the g.f. of the output sequence ((CHK c)_d: d >= 1) is -Sum_{d >= 1} (mu(d)/d) * log(1 - C(x^d)). Here, c(n) = 2 for all n >= 1, and thus, C(x) = 2*x/(1 - x). It follows that the g.f. of the output sequence is -Sum_{d >= 1} (mu(d)/d) * log(1 - 2*x^d/(1 - x^d)).
%C (End)
%H G. C. Greubel, <a href="/A185171/b185171.txt">Table of n, a(n) for n = 1..2000</a>
%H J. Blumlein, <a href="http://doi.org/10.1016/j.cpc.2009.07.004">Structural relations of harmonic sums and Mellin transforms up to weight 5</a>, Comp. Phys. Com. 180 (2009) 2218-2249 eq. 4.2
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>.
%H Jean-Christophe Novelli and Jean-Yves Thibon, <a href="http://arxiv.org/abs/0806.3682">Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions</a>, arXiv:0806.3682 [math.CO], 2008. See Eqs. (93) and (95).
%H Jean-Christophe Novelli and Jean-Yves Thibon, <a href="https://doi.org/10.1016/j.disc.2010.09.008">Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions</a>, Discrete Math. 310 (2010), no. 24, 3584-3606. See Eqs. (98) and (100).
%F From _Petros Hadjicostas_, Jun 18 2019: (Start)
%F a(1) = 2 and a(n) = (1/n) * Sum_{d|n} mu(d) * 3^(n/d) for n > 1 (from Eq. (95) in Novelli and Thibon (2008) or Eq. (100) in Novelli and Thibon (2010)).
%F a(n) = (1/n) * Sum_{d|n} mu(d) * (3^(n/d) - 1) = (1/n) * Sum_{d|n} mu(d) * A024023(n/d) for n >= 1.
%F G.f.: -Sum_{d >= 1} (mu(d)/d) * log(1 - 2*x^d/(1 - x^d)) = -x - Sum_{d >= 1} (mu(d)/d) * log(1 - 3*x^d).
%F (End)
%e From _Petros Hadjicostas_, Jun 18 2019: (Start)
%e Suppose we have two colors, say, A and B. Here, a(1) = 2 because we have the following aperiodic unmarked cyclic compositions of n = 1: 1_A and 1_B.
%e We have a(2) = 3 because we have the following aperiodic unmarked cyclic compositions of n = 2: 2_A, 2_B, and 1_A + 1_B.
%e We have a(3) = 8 because we have the following aperiodic unmarked cyclic compositions of n = 3: 3_A and 3_B; 1_X + 2_Y, where (X, Y) \in {(A, A), (A, B), (B, A), (B, B)}; 1_A + 1_B + 1_B and 1_B + 1_A + 1_A.
%e (End)
%t a[1] = 2; a[n_] := DivisorSum[n, MoebiusMu[#]*3^(n/#)&]/n; Array[a, 29] (* _Jean-François Alcover_, Dec 07 2015, adapted from PARI *)
%o (PARI) a(l=2,n) = if (n==1, l, sumdiv(n, d, moebius(d)*(1+l)^(n/d))/n); \\ _Michel Marcus_, Feb 09 2013
%Y Cf. A024023, A027376, A032251, A185172.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Jan 23 2012
%E More terms from _Michel Marcus_, Feb 09 2013
%E Name edited by _Petros Hadjicostas_, Jun 18 2019