The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199688 (8*10^n+1)/3. 2
 3, 27, 267, 2667, 26667, 266667, 2666667, 26666667, 266666667, 2666666667, 26666666667, 266666666667, 2666666666667, 26666666666667, 266666666666667, 2666666666666667, 26666666666666667, 266666666666666667, 2666666666666666667 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (11,-10). FORMULA a(n) = 3*A059482(n). a(n) = 10*a(n-1)-3. a(n) = 11*a(n-1)-10*a(n-2). G.f.: 3*(1-2*x)/((1-x)*(1-10*x)). MATHEMATICA LinearRecurrence[{11, -10}, {3, 27}, 20] (* Harvey P. Dale, Jul 24 2016 *) PROG (Magma) [(8*10^n+1)/3: n in [0..30]]; CROSSREFS Sequence in context: A235373 A279658 A026294 * A275998 A098401 A355363 Adjacent sequences: A199685 A199686 A199687 * A199689 A199690 A199691 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Nov 09 2011 STATUS approved

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.

Last modified December 5 15:27 EST 2022. Contains 358588 sequences. (Running on oeis4.)