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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069506 a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1. 6
 2, 5, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111111111111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 FORMULA a(n) = (10^(n-1)-1)/9 for n > 2. From Chai Wah Wu, Jun 20 2016: (Start) a(n) = 11*a(n-1) - 10*a(n-2) for n > 3. G.f.: (40*x^3 - 24*x^2 - 17*x + 2)/((x - 1)*(10*x - 1)). (End) MATHEMATICA CoefficientList[Series[(40 x^3 - 24 x^2 - 17 x + 2) / ((x - 1) (10 x - 1)), {x, 0, 30}], x] (* Vincenzo Librandi, Jun 21 2016 *) PROG (MAGMA) I:=[2, 5, 11, 111]; [n le 4 select I[n] else 11*Self(n-1)-10*Self(n-2): n in [1..25]]; // Vincenzo Librandi, Jun 21 2016 CROSSREFS Cf. A069505, A069507, A069508, A069509, A069510. Sequence in context: A078790 A158999 A283300 * A239900 A123165 A098438 Adjacent sequences:  A069503 A069504 A069505 * A069507 A069508 A069509 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, Mar 30 2002 EXTENSIONS More terms from Patrick De Geest, Jun 11 2003 STATUS approved

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.

Last modified May 27 21:52 EDT 2020. Contains 334671 sequences. (Running on oeis4.)