This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178205 a(n) = a(n-1) + 10*a(n-3) for n > 2; a(0) = a(1) = a(2) = 1. 3
 1, 1, 1, 11, 21, 31, 141, 351, 661, 2071, 5581, 12191, 32901, 88711, 210621, 539631, 1426741, 3532951, 8929261, 23196671, 58526181, 147818791, 379785501, 965047311, 2443235221, 6241090231, 15891563341, 40323915551, 102734817861 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS If x=a(n), y=a(n+1), z=a(n+2), then 100*x^3 + 10*x^2*z - 30*x*y*z + 10*x*y^2 + 10*y^3 - 2*y*z^2 + y^2*z + z^3 = 10^(n+2), for n >= 0. - Alexander Samokrutov, Jul 03 2015 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1,0,10). FORMULA G.f.: 1/(1-x-10*x^3). MATHEMATICA RecurrenceTable[{a[n] == a[n - 1] + 10 a[n - 3], a[0] == a[1] == a[2] == 1}, a, {n, 0, 28}] (* or *) CoefficientList[Series[1/(1 - x - 10 x^3), {x, 0, 28}], x] (* Michael De Vlieger, Jul 09 2015 *) LinearRecurrence[{1, 0, 10}, {1, 1, 1}, 30] (* Vincenzo Librandi, Jul 19 2015 *) PROG (PARI) {m=29; v=concat([1, 1, 1], vector(m-3)); for(n=4, m, v[n]=v[n-1]+10*v[n-3]); v} (MAGMA) I:=[1, 1, 1]; [n le 3 select I[n] else Self(n-1) + 10*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Jul 19 2015 (PARI) x='x+O('x^50); Vec(1/(1-x-10*x^3)) \\ G. C. Greubel, Apr 29 2017 CROSSREFS Cf. A000930 (a(n)=a(n-1)+a(n-3), a(0)=a(1)=a(2)=1). Sequence in context: A110402 A081927 A181178 * A239464 A180105 A288186 Adjacent sequences:  A178202 A178203 A178204 * A178206 A178207 A178208 KEYWORD nonn,easy AUTHOR Mark Dols, May 22 2010 EXTENSIONS Edited and extended by Klaus Brockhaus, May 23 2010 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 August 20 21:29 EDT 2019. Contains 326155 sequences. (Running on oeis4.)