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

%I #20 Apr 24 2023 02:54:31

%S 128,10000000,612220032,8031810176,52523350144,230539333248,

%T 781250000000,2207984167552,5455160701056,12151280273024,

%U 24928547056768,47829690000000,86812553324672,150363025899136,250226879128704,402271083010688,627485170000000,953133216331392,1414067010444416

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

%H Vincenzo Librandi, <a href="/A017095/b017095.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 From _Amiram Eldar_, Apr 24 2023: (Start)

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

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

%F Sum_{n>=0} 1/a(n) = 61*Pi^7/47185920 + 127*zeta(7)/32768. (End)

%t Table[(8*n + 2)^7, {n, 0, 20}] (* _Amiram Eldar_, Apr 24 2023 *)

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

%Y Cf. A013665, A016819, A017089 (8n+2), A001015 (n^7).

%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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)