|
%I #19 Sep 08 2022 08:44:41
%S 0,16384,2097152,35831808,268435456,1280000000,4586471424,13492928512,
%T 34359738368,78364164096,163840000000,319277809664,587068342272,
%U 1028071702528,1727094849536,2799360000000
%N a(n) = (4*n)^7.
%C Generating function is 128 times the g.f. of A016747. - _R. J. Mathar_, May 07 2008
%H Vincenzo Librandi, <a href="/A016807/b016807.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8, -28, 56, -70, 56, -28, 8, -1).
%F a(n) = 128*A016747(n). - _R. J. Mathar_, May 07 2008
%F a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n > 7. - _Wesley Ivan Hurt_, Oct 15 2017
%t Table[(4 n)^7, {n, 0, 15}] (* _Michael De Vlieger_, Oct 15 2017 *)
%o (Magma) [(4*n)^7: n in [0..30]]; // _Vincenzo Librandi_, Sep 05 2011
%Y Cf. A016747.
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_
|
