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 A294436 #17 Jun 07 2019 11:33:37 %S A294436 1,33,1268,50600,1972128,75121312,2803732096,102885494016, %T A294436 3722920064000,133152625650176,4715897847097344,165643005814853632, %U A294436 5776871664703455232,200235592430802124800,6903358709034568712192,236882142098621090889728,8094539021386254685569024 %N A294436 a(n) = Sum_{m=0..n} (Sum_{k=0..m} binomial(n,k))^5. %H A294436 Seiichi Manyama, <a href="/A294436/b294436.txt">Table of n, a(n) for n = 0..300</a> %H A294436 N. J. Calkin, <a href="http://dx.doi.org/10.1016/0012-365X(94)90394-8">A curious binomial identity</a>, Discr. Math., 131 (1994), 335-337. %H A294436 M. Hirschhorn, <a href="http://dx.doi.org/10.1016/0012-365X(95)00086-C">Calkin's binomial identity</a>, Discr. Math., 159 (1996), 273-278. %F A294436 a(n) ~ n * 2^(5*n - 1). - _Vaclav Kotesovec_, Jun 07 2019 %p A294436 A:=proc(n,k) local j; add(binomial(n,j),j=0..k); end; %p A294436 S:=proc(n,p) local i; global A; add(A(n,i)^p, i=0..n); end; %p A294436 [seq(S(n,5),n=0..30)]; %t A294436 Table[Sum[Sum[Binomial[n,k], {k,0,m}]^5, {m,0,n}], {n,0,15}] (* _Vaclav Kotesovec_, Jun 07 2019 *) %o A294436 (PARI) a(n) = sum(m=0, n, sum(k=0, m, binomial(n,k))^5); \\ _Michel Marcus_, Nov 18 2017 %Y A294436 Same expression with exponent b instead of 5: A001792 (b=1), A003583 (b=2), A007403 (b=3), A294435 (b=4). %K A294436 nonn %O A294436 0,2 %A A294436 _N. J. A. Sloane_, Nov 17 2017