A062397 a(n) = 10^n + 1.
2, 11, 101, 1001, 10001, 100001, 1000001, 10000001, 100000001, 1000000001, 10000000001, 100000000001, 1000000000001, 10000000000001, 100000000000001, 1000000000000001, 10000000000000001, 100000000000000001
Offset: 0
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..200
- Wikipedia, Catalan's conjecture.
- Index entries for linear recurrences with constant coefficients, signature (11,-10).
Crossrefs
Except for the initial term, essentially the same as A000533. Cf. A054977, A007395, A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A063481, A074600-A074624, A034524, A178248, A228081 for numbers one more than powers, i.e., this sequence translated from base n (> 2) to base 10.
Programs
-
Magma
[10^n + 1: n in [0..35]]; // Vincenzo Librandi, Apr 30 2011
-
Mathematica
LinearRecurrence[{11, -10},{2, 11},18] (* Ray Chandler, Aug 26 2015 *) 10^Range[0,20]+1 (* Harvey P. Dale, Jan 21 2020 *)
-
PARI
a(n)=10^n+1 \\ Charles R Greathouse IV, Sep 24 2015
Formula
From Mohammad K. Azarian, Jan 02 2009: (Start)
G.f.: 1/(1-x) + 1/(1-10*x).
E.g.f.: exp(x) + exp(10*x). (End)
Comments