login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169601 a(n) = (10^n-1)^2 + 2. 0

%I

%S 2,83,9803,998003,99980003,9999800003,999998000003,99999980000003,

%T 9999999800000003,999999998000000003,99999999980000000003,

%U 9999999999800000000003,999999999998000000000003

%N a(n) = (10^n-1)^2 + 2.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000).

%F G.f.: -(2810*x^2-139*x+2)/((x-1)*(100*x-1)*(10*x-1)).

%t (10^Range[0,20]-1)^2+2 (* _Harvey P. Dale_, Jan 08 2019 *)

%o (PARI) for(n=0,20,print1((10^n-1)^2+2","))

%K nonn,easy

%O 0,1

%A _Jason Earls_, Dec 03 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 16:22 EST 2020. Contains 331114 sequences. (Running on oeis4.)