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

%I #12 Sep 08 2022 08:44:42

%S 512,2357947691,512000000000,14507145975869,165216101262848,

%T 1119130473102767,5416169448144896,20711912837890625,

%U 66540410775079424,186940255267540403,472161363286556672,1093685272684360901

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

%H Vincenzo Librandi, <a href="/A017193/b017193.txt">Table of n, a(n) for n = 0..10000</a>

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

%o (Magma) [(9*n+2)^9: n in [0..15]]; // _Vincenzo Librandi_, Jul 23 2011

%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 27 20:03 EDT 2024. Contains 372020 sequences. (Running on oeis4.)