login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128802 a(n) = n*(n-1)*8^n. 1

%I #17 Sep 08 2022 08:45:30

%S 0,0,128,3072,49152,655360,7864320,88080384,939524096,9663676416,

%T 96636764160,944892805120,9070970929152,85761906966528,

%U 800444465020928,7388718138654720,67553994410557440,612489549322387456

%N a(n) = n*(n-1)*8^n.

%H Vincenzo Librandi, <a href="/A128802/b128802.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (24,-192,512).

%F a(n) = 24*a(n-1) - 192*a(n-2) + 512*a(n-3); a(0)=0, a(1)=0, a(2)=128. - _Harvey P. Dale_, Nov 05 2011

%F G.f.: -128*x^2/(8*x-1)^3. - _Harvey P. Dale_, Nov 05 2011

%F a(n) = 128*A081138(n). - _R. J. Mathar_, Apr 26 2015

%t Table[(n^2-n)8^n,{n,0,20}] (* or *) LinearRecurrence[{24,-192,512},{0,0,128},20] (* _Harvey P. Dale_, Nov 05 2011 *)

%o (Magma) [(n^2-n)*8^n: n in [0..20]]; // _Vincenzo Librandi_, Nov 16 2011

%Y Cf. A036289, A007758.

%K nonn,easy

%O 0,3

%A _Mohammad K. Azarian_, Apr 07 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)