The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A016943 a(n) = (6*n + 2)^11. 2

%I #23 Mar 30 2022 06:33:54

%S 2048,8589934592,4049565169664,204800000000000,3670344486987776,

%T 36028797018963968,238572050223552512,1196683881290399744,

%U 4882812500000000000,16985107389382393856,52036560683837093888,143746751770690322432,364375289404334925824,858993459200000000000

%N a(n) = (6*n + 2)^11.

%H Vincenzo Librandi, <a href="/A016943/b016943.txt">Table of n, a(n) for n = 0..2000</a>

%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (12,-66,220,-495,792,-924,792,-495,220,-66,12,-1).

%F a(n) = A016787(n)*2^11. - _Zerinvary Lajos_, Jun 22 2009

%F From _Amiram Eldar_, Mar 30 2022: (Start)

%F a(n) = A016933(n)^9 = A016935(n)^3.

%F Sum_{n>=0} 1/a(n) = 1847*Pi^11/(1285662067200*sqrt(3)) + 88573*zeta(11)/362797056. (End)

%t (6*Range[0,10]+2)^11 (* _Harvey P. Dale_, Sep 30 2019 *)

%o (Magma) [(6*n+2)^11: n in [0..25]]; // _Vincenzo Librandi_, May 05 2011

%Y Cf. A016787, A016933, A016934, A016935, A016936, A016937, A016938, A016939, A016940, A016941, A016942.

%Y Subsequence of A008455.

%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 May 26 05:37 EDT 2024. Contains 372807 sequences. (Running on oeis4.)