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!)
A016750 a(n) = (2*n)^10. 2

%I #27 Sep 08 2022 08:44:41

%S 0,1024,1048576,60466176,1073741824,10000000000,61917364224,

%T 289254654976,1099511627776,3570467226624,10240000000000,

%U 26559922791424,63403380965376,141167095653376,296196766695424,590490000000000,1125899906842624,2064377754059776,3656158440062976

%N a(n) = (2*n)^10.

%H Vincenzo Librandi, <a href="/A016750/b016750.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

%F G.f.: -1024*x*(1+x)*(x^8 + 1012*x^7 + 46828*x^6 + 408364*x^5 + 901990*x^4 + 408364*x^3 + 46828*x^2 + 1012*x + 1)/(x-1)^11. - _R. J. Mathar_, Jul 07 2017

%F From _Amiram Eldar_, Oct 11 2020: (Start)

%F Sum_{n>=1} 1/a(n) = Pi^10/95800320.

%F Sum_{n>=1} (-1)^(n+1)/a(n) = 73*Pi^10/7007109120. (End)

%p A016750:=n->(2*n)^10: seq(A016750(n), n=0..30); # _Wesley Ivan Hurt_, Sep 15 2018

%t Table[(2*n)^10, {n,0,30}] (* _G. C. Greubel_, Sep 15 2018 *)

%t LinearRecurrence[{11,-55,165,-330,462,-462,330,-165,55,-11,1},{0,1024,1048576,60466176,1073741824,10000000000,61917364224,289254654976,1099511627776,3570467226624,10240000000000},30] (* _Harvey P. Dale_, May 11 2022 *)

%o (Magma) [(2*n)^10: n in [0..20]]; // _Vincenzo Librandi_, Sep 05 2011

%o (PARI) vector(30, n, n--; (2*n)^10) \\ _G. C. Greubel_, Sep 15 2018

%Y Cf. A016762.

%K nonn,easy

%O 0,2

%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 23 08:19 EDT 2024. Contains 371905 sequences. (Running on oeis4.)