cp's OEIS Frontend

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.

A141312 Inverse Euler transform of A003480.

This page as a plain text file.
%I A141312 #12 Oct 09 2019 02:56:48
%S A141312 1,2,4,12,31,92,256,772,2291,7000,21476,66804,208935,658924,2088628,
%T A141312 6656820,21306270,68468796,220776444,714117012,2316229821,7531561676,
%U A141312 24545492916,80160031076,262279882239,859660694960,2822177751148,9278647613760,30547880467863
%N A141312 Inverse Euler transform of A003480.
%C A141312 Dimensions of the graded components of the primitive Lie algebra of the Hopf algebra of noncommutative multisymmetric functions of level 2.
%H A141312 Alois P. Heinz, <a href="/A141312/b141312.txt">Table of n, a(n) for n = 0..1000</a>
%H A141312 J.-C. Novelli and J.-Y. Thibon, <a href="https://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.
%F A141312 a(n) ~ (2 + sqrt(2))^n / n. - _Vaclav Kotesovec_, Oct 09 2019
%p A141312 EULERi(INVERT([seq(n+1,n=1..20)]));
%t A141312 terms = 29;
%t A141312 mob[m_, n_] := If[Mod[m, n] == 0, MoebiusMu[m/n], 0];
%t A141312 EULERi[b_] := Module[{a, c, i, d}, c = {}; For[i=1, i <= Length[b], i++, c = Append[c, i b[[i]] - Sum[c[[d]] b[[i-d]], {d, 1, i-1}]]]; a = {}; For[i = 1, i <= Length[b], i++, a = Append[a, (1/i) Sum[mob[i, d] c[[d]], {d, 1, i}]]]; Return[a]];
%t A141312 Join[{1}, EULERi[LinearRecurrence[{4, -2}, {2, 7}, terms-1]]] (* _Jean-François Alcover_, Nov 25 2018 *)
%Y A141312 Cf. A003480.
%K A141312 nonn
%O A141312 0,2
%A A141312 Jean-Yves Thibon (jyt(AT)univ-mlv.fr), Jun 26 2008
%E A141312 More terms from _Alois P. Heinz_, Feb 20 2017