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

%I #18 Jul 07 2022 08:08:07

%S 64,46656,1000000,7529536,34012224,113379904,308915776,729000000,

%T 1544804416,3010936384,5489031744,9474296896,15625000000,24794911296,

%U 38068692544,56800235584,82653950016,117649000000,164206490176,225199600704,304006671424,404567235136,531441000000

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

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).

%F a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7). - _Harvey P. Dale_, Oct 14 2012

%F From _Amiram Eldar_, Jul 07 2022: (Start)

%F a(n) = A016825(n)^6 = A016826(n)^3 = A016827(n)^2 = 64*A016758(n).

%F Sum_{n>=0} 1/a(n) = Pi^6/61440. (End)

%t (4*Range[0,20]+2)^6 (* or *) LinearRecurrence[{7,-21,35,-35,21,-7,1},{64,46656,1000000,7529536,34012224,113379904,308915776},20] (* _Harvey P. Dale_, Oct 14 2012 *)

%Y Cf. A016758, A016825, A016826, A016827.

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