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.

A277178 a(n) = Sum_{k=0..n} k*binomial(2*k,k)/2.

This page as a plain text file.
%I A277178 #26 Feb 16 2025 08:33:36
%S A277178 0,1,7,37,177,807,3579,15591,67071,285861,1209641,5089517,21314453,
%T A277178 88918353,369734553,1533115953,6341759073,26177411943,107853629643,
%U A277178 443633635743,1822098923943,7473806605563,30618895206483,125303348573883,512274592771083,2092407173242983,8539348101568335
%N A277178 a(n) = Sum_{k=0..n} k*binomial(2*k,k)/2.
%H A277178 Seiichi Manyama, <a href="/A277178/b277178.txt">Table of n, a(n) for n = 0..1658</a>
%H A277178 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CentralBinomialCoefficient.html">Central Binomial Coefficient</a>.
%F A277178 a(n) = binomial(2*n,n) * (2*n + 1 - hypergeom([1,-n], [1/2-n], 1/4))/3.
%F A277178 a(n+1) - a(n) = A002457(n) = (2*n+1)!/n!^2.
%F A277178 Recurrence: (5*n + 2) * a(n) = (4*n + 2) * a(n-1) + n * a(n+1).
%F A277178 a(n) ~ sqrt(n) * 2^(2*n+1) / (3*sqrt(Pi)). - _Vaclav Kotesovec_, Jan 29 2019
%F A277178 G.f.: x/(1-x) * (1-4*x)^(-3/2). - _Seiichi Manyama_, Jan 29 2019
%p A277178 a:=n->sqrt(-1/27)-((n+1)/2)*binomial(2*(n+1),n+1)*hypergeom([1,n+3/2],[n+1],4):
%p A277178 seq(simplify(a(n)), n=0..26); # _Peter Luschny_, Oct 03 2016
%t A277178 Table[Binomial[2 n, n] (2 n + 1 - Hypergeometric2F1[1, -n, 1/2 - n, 1/4])/3, {n, 0, 30}]
%o A277178 (PARI) {a(n) = sum(k=0, n, k*binomial(2*k, k))/2} \\ _Seiichi Manyama_, Jan 29 2019
%Y A277178 Row 3 of A323222.
%Y A277178 Cf. A000984, A002457.
%K A277178 nonn
%O A277178 0,3
%A A277178 _Vladimir Reshetnikov_, Oct 02 2016