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

%I #15 Sep 08 2022 08:46:00

%S 10,100,1090,11980,131770,1449460,15944050,175384540,1929229930,

%T 21221529220,233436821410,2567805035500,28245855390490,

%U 310704409295380,3417748502249170,37595233524740860,413547568772149450,4549023256493643940

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

%H Vincenzo Librandi, <a href="/A199763/b199763.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.: 10*(1-2*x)/((1-x)*(1-11*x)).

%t 9*11^Range[0,20]+1 (* or *) LinearRecurrence[{12,-11},{10,100},20] (* _Harvey P. Dale_, Sep 06 2021 *)

%o (Magma) [9*11^n+1: n in [0..30]];

%K nonn,easy

%O 0,1

%A _Vincenzo Librandi_, Nov 10 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 July 13 18:54 EDT 2024. Contains 374285 sequences. (Running on oeis4.)