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.
%I A244654 #14 Jul 05 2014 02:20:32 %S A244654 1,34,889,22344,568750,14812084,394432598,10708188328,295488284471, %T A244654 8266624187654,233974149056711,6688412821905136,192840384283521996, %U A244654 5601534217892577384,163776154208030704124,4816121399286395128048,142353930553713780303773,4226997830260963262597162 %N A244654 G.f. A(x) satisfies: Sum_{k=0..n} [x^k] A(x)^n = binomial(7*n,3*n). %C A244654 Compare to Sum_{k=0..n} [x^k] 1/(1-x)^(6*n) = binomial(7*n,n). %C A244654 Compare to Sum_{k=0..n} [x^k] 1/((1-x)*(1-2*x)^2)^n = binomial(4*n,2*n). %H A244654 Vaclav Kotesovec, <a href="/A244654/b244654.txt">Table of n, a(n) for n = 0..318</a> %H A244654 Vaclav Kotesovec, <a href="/A244654/a244654.txt">Recurrence (of order 11)</a> %F A244654 a(n) ~ c * d^n / (sqrt(Pi) * n^(3/2)), where d = 32.201406653616068490560634175718122449630172934... is the root of the equation 67228 - 48020*d - 199969*d^2 + 287875*d^3 - 109375*d^4 + 3125*d^5 = 0, and c = 14.332013639348773543921130720591338... . - _Vaclav Kotesovec_, Jul 04 2014 %e A244654 G.f.: A(x) = 1 + 34*x + 889*x^2 + 22344*x^3 + 568750*x^4 + 14812084*x^5 +... %e A244654 ILLUSTRATION OF INITIAL TERMS. %e A244654 If we form an array of coefficients of x^k in A(x)^n, n>=0, like so: %e A244654 A^0: [1], 0, 0, 0, 0, 0, ...; %e A244654 A^1: [1, 34], 889, 22344, 568750, 14812084, ...; %e A244654 A^2: [1, 68, 2934], 105140, 3447213, 108026800, ...; %e A244654 A^3: [1, 102, 6135, 287692], 11718441, 437745882, ...; %e A244654 A^4: [1, 136, 10492, 609304, 29801822], 1301836088, ...; %e A244654 A^5: [1, 170, 16005, 1109280, 63453080, 3183364624],...; ... %e A244654 then we can illustrate how the sum of the coefficients of x^k, k=0..n, in A(x)^n (shown above in brackets) equals C(7*n,3*n): %e A244654 C( 0, 0) = 1 = 1; %e A244654 C( 7, 3) = 1 + 34 = 35; %e A244654 C(14, 6) = 1 + 68 + 2934 = 3003; %e A244654 C(21, 9) = 1 + 102 + 6135 + 287692 = 293930; %e A244654 C(28,12) = 1 + 136 + 10492 + 609304 + 29801822 = 30421755; %e A244654 C(35,15) = 1 + 170 + 16005 + 1109280 + 63453080 + 3183364624 = 3247943160; ... %o A244654 (PARI) /* By Definition (slow): */ %o A244654 {a(n)=if(n==0, 1, ( binomial(7*n,3*n) - sum(k=0, n, polcoeff(sum(j=0, min(k, n-1), a(j)*x^j/1!)^n + x*O(x^k), k)))/n)} %o A244654 for(n=0, 20, print1(a(n), ", ")) %o A244654 (PARI) /* Faster, using series reversion: */ %o A244654 {a(n)=local(B=sum(k=0, n+1, binomial(7*k,3*k)*x^k)+x^3*O(x^n), G=1+x*O(x^n)); %o A244654 for(i=1, n, G = 1 + intformal( (B-1)*G/x - B*G^2)); polcoeff(x/serreverse(x*G), n)} %o A244654 for(n=0, 30, print1(a(n), ", ")) %Y A244654 Cf. A232606, A232683, A232687, A244650, A244651, A244652, A244653. %K A244654 nonn %O A244654 0,2 %A A244654 _Paul D. Hanna_, Jul 03 2014