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

%I #18 Mar 20 2023 05:06:49

%S 9,109,1209,13309,146409,1610509,17715609,194871709,2143588809,

%T 23579476909,259374246009,2853116706109,31384283767209,

%U 345227121439309,3797498335832409,41772481694156509,459497298635721609,5054470284992937709

%N a(n) = 10*11^n-1.

%H Vincenzo Librandi, <a href="/A199030/b199030.txt">Table of n, a(n) for n = 0..900</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-11).

%F a(n) = 11*a(n-1)+10.

%F a(n) = 12*a(n-1)-11*a(n-2).

%F G.f.: (9+x)/((1-x)*(1-11*x)). - _Bruno Berselli_, Nov 03 2011

%o (Magma) [10*11^n-1: n in [0..20]];

%K nonn,easy

%O 0,1

%A _Vincenzo Librandi_, Nov 03 2011

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)