cp's OEIS Frontend

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.

A128967 a(n) = (n^3-n)*8^n.

This page as a plain text file.
%I A128967 #23 Oct 02 2022 10:33:01
%S A128967 0,384,12288,245760,3932160,55050240,704643072,8455716864,96636764160,
%T A128967 1063004405760,11338713661440,117922622078976,1200666697531392,
%U A128967 12006666975313920,118219490218475520,1148417904979476480,11024811887802974208,104735712934128254976
%N A128967 a(n) = (n^3-n)*8^n.
%H A128967 Vincenzo Librandi, <a href="/A128967/b128967.txt">Table of n, a(n) for n = 1..1000</a>
%H A128967 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (32,-384,2048,-4096).
%F A128967 From _R. J. Mathar_, Dec 19 2008: (Start)
%F A128967 G.f.: 384x^2/(1-8x)^4.
%F A128967 a(n) = 384*A140802(n-2). (End)
%F A128967 a(n) = 32*a(n-1) - 384*a(n-2) + 2048*a(n-3) - 4096*a(n-4). - _Vincenzo Librandi_, Feb 11 2013
%F A128967 From _Amiram Eldar_, Oct 02 2022: (Start)
%F A128967 a(n) = A007531(n+1)*A001018(n).
%F A128967 Sum_{n>=2} 1/a(n) = (49/16)*log(8/7) - 13/32.
%F A128967 Sum_{n>=2} (-1)^n/a(n) = (81/16)*log(9/8) - 19/32. (End)
%t A128967 LinearRecurrence[{32, -384, 2048, -4096}, {0, 384, 12288, 245760}, 30] (* _Vincenzo Librandi_, Feb 11 2013 *)
%o A128967 (Magma)[(n^3 - n)*8^n: n in [1..25]]; // _Vincenzo Librandi_, Feb 11 2013
%Y A128967 Cf. A001018, A007531, A036289, A128796, A140802.
%Y A128967 Cf. A128960, A128961, A128962, A128963, A128964, A128965, A128969.
%K A128967 nonn,easy
%O A128967 1,2
%A A128967 _Mohammad K. Azarian_, Apr 28 2007
%E A128967 Corrected the offset. - _Mohammad K. Azarian_, Nov 20 2008