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!)
A016963 a(n) = (6*n + 4)^7. 6

%I #17 Mar 31 2022 10:17:09

%S 16384,10000000,268435456,2494357888,13492928512,52523350144,

%T 163840000000,435817657216,1028071702528,2207984167552,4398046511104,

%U 8235430000000,14645194571776,24928547056768,40867559636992,64847759419264,100000000000000,150363025899136,221068140740608

%N a(n) = (6*n + 4)^7.

%H Vincenzo Librandi, <a href="/A016963/b016963.txt">Table of n, a(n) for n = 0..1000</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 From _Amiram Eldar_, Mar 31 2022: (Start)

%F a(n) = A016957(n)^7.

%F a(n) = 2^7*A016795(n).

%F Sum_{n>=0} 1/a(n) = 1093*zeta(7)/279936 - 7*Pi^7/(3149280*sqrt(3)). (End)

%t (6*Range[0,20]+4)^7 (* or *) LinearRecurrence[{8,-28,56,-70,56,-28,8,-1},{16384,10000000,268435456,2494357888,13492928512,52523350144,163840000000,435817657216},20] (* _Harvey P. Dale_, Mar 03 2018 *)

%o (Magma) [(6*n+4)^7: n in [0..20]]; // _Vincenzo Librandi_, May 07 2011

%Y Cf. A016795, A016957, A016958, A016959, A016960, A016961, A016962.

%Y Subsequence of A001015.

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