The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333715 a(n) = [x^(3*n)] ( (1 + x)/(1 - x) )^n. 5
 1, 2, 24, 326, 4672, 69002, 1038984, 15856206, 244396544, 3795731282, 59307908024, 931222155030, 14680871849152, 232236016459098, 3684420837693480, 58600075142247326, 934064636705476608, 14917333936933664674, 238641621366613695576, 3823510794994321546214, 61344017874989324388672 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is also equal to [x^n] G(x)^n, where G(x) is the o.g.f. of A027307. Compare with A002003(n) = [x^n] ( (1 + x)/(1 - x) )^n and A103885(n) = [x^(2*n)] ( (1 + x)/(1 - x) )^n = [x^n] S(x)^n, where S(x) is the o.g.f. of the large Schröder numbers A006318. If we define an operator I acting on power series f(x) = 1 + f_1*x + f_2*x^2 + ... by I(f(x)) = 1/x * Revert( x/f(x) ) then S(x) = I( (1 + x)/(1 - x) ) and G(x) = (I o I)( (1 + x)/(1 - x )). It can be shown that a(n) satisfies the Gauss congruences a(n*p^k) == a(n*p^(k-1)) ( mod p^k ) for all prime p and positive integers n and k. We conjecture that a(n) satisfies the stronger congruences a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers n and k. Some examples of these congruences are given below. The same congruences may hold more generally for the sequences a(r,s,n) := [x^(r*n)]( (1 + x)/(1 - x) )^(s*n), r a positive integer and s an integer. This is the case a(3,1,n). For fixed m = 1,2,3,..., we conjecture that the sequence b(n) := a(m*n) satisfies a recurrence of the form P(6*m,n)*b(n+1) + P(6*m,-n)*b(n-1) = Q(3*m,n^2)*b(n), where the polynomials P(6*m,n) and Q(3*m,n^2) have degree 6*m. Conjecturally, the 6*m zeros of the polynomial Q(3*m,n^2) belong to the interval [-1, 1] and 6*m - 4 of these zeros appear to be approximated by the rational numbers +- k/(4*m), where 1 <= k <= 4*m - 3, k not a multiple of 4. LINKS Seiichi Manyama, Table of n, a(n) for n = 0..824 FORMULA a(n) = Sum_{k = 0..n} C(n,k)*C(3*n+k-1,n-1). a(n) = (1/3) * Sum_{k = 0..n} C(3*n,n-k)*C(3*n+k-1,k) for n >= 1. a(n) = (1/3) * [x^n] ( (1 + x)/(1 - x) )^(3*n). a(n) = Sum_{k = 1..n} (2^k)*C(n,k)*C(3*n-1,k-1) for n >= 1. P-recursive: P(6,n)*a(n+1) + P(6,-n)*a(n-1) = Q(3,n^2)*a(n), where P(6,n) = (2*n-1)*(3*n+1)*(3*n+2)*(3*n+3)*(35*n^2 - 35*n + 6) and the polynomial Q(3,n) = 4*(7805*n^3 - 7132*n^2 + 1559*n - 72). Congruences: a(p) == 2 ( mod p^3 ) for prime p >= 3. a(n) ~ (223 + 70*sqrt(10))^n / (2^(3/4) * 5^(1/4) * sqrt(Pi*n) * 3^(3*n + 1/2)). - Vaclav Kotesovec, Apr 04 2020 EXAMPLE Examples of congruences: a(11) - a(1) = 931222155030 - 2 = (2^2)*(11^3)*163*1073069 == ( mod 11^3 ) a(3*7) - a(3) = 985413034951400888962602 - 326 = (2^2)*(7^4)*263* 390130947874776863 == 0 ( mod 7^3 ) a(5^2) - a(5) = 66292579025690123511768694002 - 69002 = (2^3)*(5^6)*39461* 13439614612035199009 == 0 ( mod 5^6 ) MAPLE seq(add(binomial(n, k)*binomial(3*n+k-1, n-1), k = 0..n), n = 0..20); MATHEMATICA Table[Binomial[3*n-1, n-1] * Hypergeometric2F1[-n, 3*n, 2*n+1, -1], {n, 0, 20}] (* Vaclav Kotesovec, Apr 04 2020 *) CROSSREFS Cf. A002003, A027307, A103885. Sequence in context: A099045 A181174 A209290 * A081065 A043699 A220317 Adjacent sequences: A333712 A333713 A333714 * A333716 A333717 A333718 KEYWORD nonn,easy AUTHOR Peter Bala, Apr 03 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 07:55 EST 2022. Contains 358493 sequences. (Running on oeis4.)