This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268414 a(n) = 5*a(n - 1) - 2*n for n>0, a(0) = 1. 0
 1, 3, 11, 49, 237, 1175, 5863, 29301, 146489, 732427, 3662115, 18310553, 91552741, 457763679, 2288818367, 11444091805, 57220458993, 286102294931, 1430511474619, 7152557373057, 35762786865245, 178813934326183, 894069671630871, 4470348358154309 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS In general, the ordinary generating function for the recurrence relation b(n) = k*b(n - 1) - m*n, with n>0 and b(0)=1, is (1 - (m + 2)*x + x^2)/((1 - x)^2*(1 - k*x)). This recurrence gives the closed form b(n) = ((k^2 - k*(m + 2) + 1)*k^n + m*((k - 1)*n + k))/(k - 1)^2. LINKS Index entries for linear recurrences with constant coefficients, signature (7,-11,5). FORMULA G.f.: (1 - 4*x + x^2)/((1 - x)^2*(1 - 5*x)). a(n) = (4*n + 3*5^n + 5)/8. Sum_{n>=0} 1/a(n) = 1.449934283402232875... Lim_{n -> infinity} a(n + 1)/a(n) = 5. MATHEMATICA Table[(4 n + 3 5^n + 5)/8, {n, 0, 23}] LinearRecurrence[{7, -11, 5}, {1, 3, 11}, 24] PROG (PARI) Vec((1-4*x+x^2)/((1-x)^2*(1-5*x)) + O(x^100)) \\ Altug Alkan, Feb 04 2016 (MAGMA) [(4*n + 3*5^n + 5)/8: n in [0..30]]; // Vincenzo Librandi, Feb 06 2016 CROSSREFS Cf. A014827, A024050, A094195, A104745, A107585, A164045, A176916, A221907. Sequence in context: A025539 A172440 A254536 * A074528 A246985 A004211 Adjacent sequences:  A268411 A268412 A268413 * A268415 A268416 A268417 KEYWORD nonn,easy AUTHOR Ilya Gutkovskiy, Feb 04 2016 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 18:36 EDT 2018. Contains 316529 sequences. (Running on oeis4.)