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!)
A017623 a(n) = (12*n + 8)^7. 1

%I #25 Sep 08 2022 08:44:43

%S 2097152,1280000000,34359738368,319277809664,1727094849536,

%T 6722988818432,20971520000000,55784660123648,131593177923584,

%U 282621973446656,562949953421312,1054135040000000,1874584905187328

%N a(n) = (12*n + 8)^7.

%H Vincenzo Librandi, <a href="/A017623/b017623.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) = 16384 * A016795(n). - _R. J. Mathar_, May 11 2008

%F G.f.: 16384*(x^7 + 16376*x^6 + 692499*x^5 + 3870352*x^4 + 4890287*x^3 + 1475736*x^2 + 77101*x + 128)/(x-1)^8. - _Colin Barker_, Aug 17 2012

%F E.g.f.: 16384*(128 +77997*x +970515*x^2 +2238327*x^3 +1655640*x^4 +479682*x^5 +56133*x^6 +2187*x^7)*exp(x). - _G. C. Greubel_, Nov 08 2018

%t (12*Range[0,15]+8)^7 (* _Harvey P. Dale_, Aug 16 2011 *)

%o (Magma) [(12*n+8)^7: n in [0..20]]; // _Vincenzo Librandi_, Aug 17 2011

%o (PARI) vector(20, n, n--; (12*n+8)^7) \\ _G. C. Greubel_, Nov 08 2018

%Y Cf. A016795.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)