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

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

%S 1024,25937424601,10240000000000,420707233300201,6278211847988224,

%T 52599132235830049,303305489096114176,1346274334462890625,

%U 4923990397355877376,15516041187205853449,43438845422363213824

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

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

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11, -55, 165, -330, 462, -462, 330, -165, 55, -11, 1).

%o (Magma) [(9*n+2)^10: 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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)