login
Catalan trisection: A000108(3*n), n >= 0.
15

%I #37 Feb 24 2023 02:04:52

%S 1,5,132,4862,208012,9694845,477638700,24466267020,1289904147324,

%T 69533550916004,3814986502092304,212336130412243110,

%U 11959798385860453492,680425371729975800390,39044429911904443959240,2257117854077248073253720,131327898242169365477991900,7684785670514316385230816156,451959718027953471447609509424

%N Catalan trisection: A000108(3*n), n >= 0.

%C Trisection of a sequence, given by its real o.g.f. G(x), is accomplished by

%C G(x) = G0(x^3) + x*G1(x^3) + (x^2)*G2(x^3), with the following solutions (using r := exp(2*Pi*i/3) = (-1 + sqrt(3)*i)/2):

%C G0(x) = (G(x^(1/3) + (G(r*x^(1/3)) + c.c.))/3,

%C G1(x) = (G(x^(1/3)) + ((1/r)*G(r*x^(1/3)) + c.c.))/(3*x^(1/3)),

%C G2(x) = (G(x^(1/3)) + (r*G(r*x^(1/3)) + c.c.))/(3*x^(2/3)),

%C where c.c. denotes the complex conjugate of the preceding expression.

%C See also the J. Arndt link, sect. 36.1.4,p.688: "Multisection by selecting terms with exponents s mod M", with M=3, where the o.g.f.s for the M-sected sequences with interspersed zeros are given for the general case.

%H Joerg Arndt, <a href="http://www.jjj.de/fxt">Fxtbook</a>.

%F a(n) = C(3*n), n >= 0, with C(n):= A000108(n) (Catalan).

%F O.g.f.: G0(x) = (sqrt(2*sqrt(1 + 4*x^(1/3) + 16*x^(2/3)) - (1 - 4*x^(1/3))) - sqrt(1 - 4*x^(1/3)))/(6*x^(1/3)).

%F From _Ilya Gutkovskiy_, Jan 13 2017: (Start)

%F E.g.f.: 3F3(1/6,1/2,5/6; 2/3,1,4/3; 64*x).

%F a(n) ~ 64^n/(3*sqrt(3*Pi)*n^(3/2)). (End)

%F D-finite with recurrence n*(3*n-1)*(3*n+1)*a(n) -8*(6*n-5)*(6*n-1)*(2*n-1)*a(n-1)=0. - _R. J. Mathar_, Feb 21 2020

%F Sum_{n>=0} a(n)/4^n = (4/3)^(3/4) (A208745). - _Amiram Eldar_, Mar 16 2022

%F a(n) = Product_{1 <= i <= j <= 3*n-1} (3*i + j + 2)/(3*i + j - 1). - _Peter Bala_, Feb 22 2023

%t Table[CatalanNumber[3*n], {n, 0, 20}] (* _Amiram Eldar_, Mar 16 2022 *)

%Y Cf. A000108, A024492, A048990, A187358 (C(3*n+1)), A187359 (C(3*n+2)/2), A208745.

%K nonn,easy

%O 0,2

%A _Wolfdieter Lang_, Mar 09 2011