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 A056468 #20 Nov 26 2021 10:39:23
%S A056468 0,1,66,924,7400,44040,217392,942592,3714048,13593600,46914560,
%T A056468 154328064,487778304,1490384896,4423372800,12801146880,36235378688,
%U A056468 100580917248,274361352192,736775372800,1950815354880,5099601002496,13176144920576,33682341494784
%N A056468 a(n) = Sum_{k=1..n} k^6*binomial(n,k).
%H A056468 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (14,-84,280,-560,672,-448,128).
%F A056468 a(n) = 2^(n-6)*n*(n+1)*(n^4 + 14*n^3 + 31*n^2 - 46*n + 16).
%F A056468 G.f.: -x*(136*x^4-272*x^3+84*x^2+52*x+1)/(2*x-1)^7. [_Colin Barker_, Sep 20 2012]
%t A056468 Table[Sum[k^6*Binomial[n, k], {k, n}], {n, 0, 30}] (* _T. D. Noe_, Nov 22 2013 *)
%o A056468 (PARI) a(n) = sum(k = 1, n, k^6*binomial(n,k)); \\ _Michel Marcus_, Nov 20 2013
%Y A056468 Cf. A001788, A059338, A058649, A058645.
%K A056468 nonn,easy
%O A056468 0,3
%A A056468 _Benoit Cloitre_, Dec 06 2002