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 A084641 #24 Mar 22 2023 08:13:43
%S A084641 0,1,130,2574,25904,183200,1040112,5076400,22171648,88915968,
%T A084641 333209600,1181548544,4001402880,13033885696,41061830656,125666611200,
%U A084641 374947708928,1093874155520,3128047828992,8785866391552,24280799641600,66124498599936,177683966197760
%N A084641 Binomial transform of n^7.
%C A084641 The binomial transforms of n, n^2, n^3, n^4, n^5, n^6 are A001787, A001788, A058645, A058649, A059338, A056468 respectively.
%H A084641 G. C. Greubel, <a href="/A084641/b084641.txt">Table of n, a(n) for n = 0..1000</a>
%H A084641 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (16,-112,448,-1120,1792,-1792,1024,-256).
%F A084641 a(n) = n^2*(n^5 + 21*n^4 + 105*n^3 + 35*n^2 - 210*n + 112)*2^(n-7).
%F A084641 a(n) = Sum_{k=0..n} C(n, k)*k^7.
%F A084641 G.f.: x*(1+114*x+606*x^2-1168*x^3-96*x^4+816*x^5-272*x^6)/(1-2*x)^8. - _Colin Barker_, Sep 20 2012
%t A084641 LinearRecurrence[{16,-112,448,-1120,1792,-1792,1024,-256}, {0,1,130, 2574,25904,183200,1040112,5076400}, 41] (* _Amiram Eldar_, Nov 26 2021 *)
%o A084641 (Magma) [n^2*(n^5+21*n^4+105*n^3+35*n^2-210*n+112)*2^(n-7): n in [0..40]]; // _G. C. Greubel_, Mar 20 2023
%o A084641 (SageMath) [n^2*(n^5+21*n^4+105*n^3+35*n^2-210*n+112)*2^(n-7) for n in range(41)] # _G. C. Greubel_, Mar 20 2023
%Y A084641 Cf. A001015, A001787, A001788, A058645, A058649, A059338, A056468.
%K A084641 easy,nonn
%O A084641 0,3
%A A084641 _Paul Barry_, Jun 08 2003