The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017409 a(n) = (11n+1)^9. 0

%I #10 Jan 25 2022 21:42:08

%S 1,5159780352,1801152661463,60716992766464,756680642578125,

%T 5416169448144896,27206534396294947,106868920913284608,

%U 350356403707485209,1000000000000000000,2558036924386500591

%N a(n) = (11n+1)^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 a(0)=1, a(1)=5159780352, a(2)=1801152661463, a(3)=60716992766464, a(4)=756680642578125, a(5)=5416169448144896, a(6)=27206534396294947, a(7)=106868920913284608, a(8)=350356403707485209, a(9)=1000000000000000000, a(n)=10*a(n-1)-45*a(n-2)+120*a(n-3)-210*a(n-4)+ 252*a(n-5)- 210*a(n-6)+ 120*a(n-7)- 45*a(n-8)+ 10*a(n-9)- a(n-10). - _Harvey P. Dale_, Mar 13 2013

%t (11*Range[0,20]+1)^9 (* or *) LinearRecurrence[{10,-45,120,-210,252,-210,120,-45,10,-1},{1,5159780352,1801152661463,60716992766464,756680642578125,5416169448144896,27206534396294947,106868920913284608,350356403707485209,1000000000000000000},20] (* _Harvey P. Dale_, Mar 13 2013 *)

%K nonn,easy

%O 0,2

%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.

Last modified September 18 07:20 EDT 2024. Contains 375996 sequences. (Running on oeis4.)