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 A306609 #16 Jun 02 2025 15:21:44 %S A306609 0,15,465,11102,236997,4751010,91474890,1712391420,31398038701, %T A306609 566621243642,10097483539038,178113001428004,3115342162844450, %U A306609 54103694774702292,933929099838928692,16037182307150776056,274132978890654857853,4667160114821964359530,79177297937966956038102,1338972240005810710258452 %N A306609 a(n) = Sum_{k=0..n} k*binomial(4*n+2,2*k). %H A306609 Seiichi Manyama, <a href="/A306609/b306609.txt">Table of n, a(n) for n = 0..828</a> %H A306609 MathOverflow, <a href="https://mathoverflow.net/questions/324341/specific-partial-sum-of-even-odd-binomial-coefficients/324343">Specific partial sum of even/odd binomial coefficients</a> %F A306609 a(n) = (n+1/2)*(16^n - binomial(4*n,2*n)) = (2*n+1)*A000346(2*n-1). %F A306609 -512*(4*n + 1)*(86*n + 213)*(3 + 4*n)*(n + 1)*a(n) + 32*(2336*n^4 + 8800*n^3 + 10524*n^2 + 11540*n + 9703)*a(n + 1) - 2*(n + 2)*(544*n^3 - 1072*n^2 + 1138*n + 8055)*a(n + 2) - (2*n + 5)*(26*n - 31)*(n + 3)*(n + 2)*a(n + 3) = 0. %F A306609 a(n) ~ 16^n * (n - sqrt(n/(2*Pi)) + 1/2). %p A306609 f:= n -> (n+1/2)*(16^n-binomial(4*n,2*n)): %p A306609 map(f, [$0..30]); %t A306609 Table[Sum[k Binomial[4n+2,2k],{k,0,n}],{n,0,20}] (* _Harvey P. Dale_, Jun 14 2024 *) %o A306609 (GAP) List([0..30],n->Sum([0..n],k->k*Binomial(4*n+2,2*k))); # _Muniru A Asiru_, Mar 01 2019 %Y A306609 Cf. A000346. %K A306609 nonn %O A306609 0,2 %A A306609 _Robert Israel_, Feb 28 2019