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!)
A016833 a(n) = (4n+2)^9. 1

%I #15 Apr 21 2023 05:47:02

%S 512,10077696,1000000000,20661046784,198359290368,1207269217792,

%T 5429503678976,19683000000000,60716992766464,165216101262848,

%U 406671383849472,922190162669056,1953125000000000,3904305912313344,7427658739644928,13537086546263552,23762680013799936

%N a(n) = (4n+2)^9.

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1).

%F From _Amiram Eldar_, Apr 21 2023: (Start)

%F a(n) = A016825(n)^9.

%F a(n) = 2^9*A016761(n).

%F Sum_{n>=0} 1/a(n) = 511*zeta(9)/262144.

%F Sum_{n>=0} (-1)^n/a(n) = 277*Pi^9/4227858432. (End)

%t (4*Range[0,20]+2)^9 (* or *) LinearRecurrence[{10,-45,120,-210,252,-210,120,-45,10,-1},{512,10077696,1000000000,20661046784,198359290368,1207269217792,5429503678976,19683000000000,60716992766464,165216101262848},20] (* _Harvey P. Dale_, May 26 2018 *)

%Y Cf. A013667, A016761, A016825.

%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 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)