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 A248168 #32 Aug 18 2025 09:58:59 %S A248168 1,7,57,511,4849,47607,477609,4862319,50026977,518839783,5414767897, %T A248168 56795795679,598213529809,6322787125207,67026654455433, %U A248168 712352213507151,7587639773475777,80977812878889927,865716569022673401,9269461606674304959,99387936492243451569,1066975862517563301303 %N A248168 Expansion of g.f. 1/sqrt((1-3*x)*(1-11*x)). %H A248168 Seiichi Manyama, <a href="/A248168/b248168.txt">Table of n, a(n) for n = 0..961</a> %H A248168 Hacène Belbachir, Abdelghani Mehdaoui, and László Szalay, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL22/Szalay/szalay42.html">Diagonal Sums in the Pascal Pyramid, II: Applications</a>, J. Int. Seq., Vol. 22 (2019), Article 19.3.5. %H A248168 Paveł Szabłowski, <a href="https://cdm.ucalgary.ca/article/view/76214">Beta distributions whose moment sequences are related to integer sequences listed in the OEIS</a>, Contrib. Disc. Math. (2024) Vol. 19, No. 4, 85-109. See p. 97. %F A248168 a(n) equals the central coefficient in (1 + 7*x + 4*x^2)^n, n>=0. %F A248168 a(n) = Sum_{k=0..n} 3^(n-k) * 2^k * C(n,k) * C(2*k,k). %F A248168 a(n) = Sum_{k=0..n} 11^(n-k) * (-2)^k * C(n,k) * C(2*k,k). - _Paul D. Hanna_, Apr 20 2019 %F A248168 a(n)^2 = A248167(n), which gives the coefficients in 1 / AGM(1-3*11*x, sqrt((1-3^2*x)*(1-11^2*x))). %F A248168 Equals the binomial transform of 2^n*A026375(n). %F A248168 Equals the second binomial transform of A084771. %F A248168 Equals the third binomial transform of A059304(n) = 2^n*(2*n)!/(n!)^2. %F A248168 a(n) ~ 11^(n+1/2)/(2*sqrt(2*Pi*n)). - _Vaclav Kotesovec_, Oct 03 2014 %F A248168 D-finite with recurrence: n*a(n) +7*(-2*n+1)*a(n-1) +33*(n-1)*a(n-2)=0. [Belbachir] %F A248168 a(n) = (1/4)^n * Sum_{k=0..n} 3^k * 11^(n-k) * binomial(2*k,k) * binomial(2*(n-k),n-k). - _Seiichi Manyama_, Aug 18 2025 %e A248168 G.f.: A(x) = 1 + 7*x + 57*x^2 + 511*x^3 + 4849*x^4 + 47607*x^5 +... %e A248168 where A(x)^2 = 1/((1-3*x)*(1-11*x)): %e A248168 A(x)^2 = 1 + 14*x + 163*x^2 + 1820*x^3 + 20101*x^4 + 221354*x^5 +... %t A248168 CoefficientList[Series[1/Sqrt[(1-3*x)*(1-11*x)], {x, 0, 20}], x] (* _Vaclav Kotesovec_, Oct 03 2014 *) %o A248168 (PARI) {a(n)=polcoeff( 1 / sqrt((1-3*x)*(1-11*x) +x*O(x^n)), n) } %o A248168 for(n=0, 25, print1(a(n), ", ")) %o A248168 (PARI) {a(n)=polcoeff( (1 + 7*x + 4*x^2 +x*O(x^n))^n, n) } %o A248168 for(n=0, 25, print1(a(n), ", ")) %o A248168 (PARI) {a(n)=sum(k=0,n, 3^(n-k)*2^k*binomial(n,k)*binomial(2*k,k))} %o A248168 for(n=0, 25, print1(a(n), ", ")) %o A248168 (Magma) %o A248168 [n le 2 select 7^(n-1) else (7*(2*n-3)*Self(n-1) - 33*(n-2)*Self(n-2))/(n-1) : n in [1..40]]; // _G. C. Greubel_, May 31 2025 %o A248168 (SageMath) %o A248168 @CachedFunction %o A248168 def A248168(n): %o A248168 if (n<2): return 7^n %o A248168 else: return (7*(2*n-1)*A248168(n-1) - 33*(n-1)*A248168(n-2))//n %o A248168 print([A248168(n) for n in range(41)]) # _G. C. Greubel_, May 31 2025 %Y A248168 Cf. A248167, A084771. %K A248168 nonn %O A248168 0,2 %A A248168 _Paul D. Hanna_, Oct 03 2014