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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A335720 a(n) = 2*a(n-1) + 3*a(n-2) + 5*a(n-3), a(0) = 0, a(1) = 1, a(2) = 1. 3
 0, 1, 1, 5, 18, 56, 191, 640, 2133, 7141, 23881, 79850, 267048, 893051, 2986496, 9987385, 33399513, 111693661, 373522786, 1249124120, 4177284903, 13969556096, 46716587501, 156228267805, 522454078593, 1747175898106, 5842855371016, 19539508829315, 65343463262208 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS In Soykan (2020), this sequences is referred to as E_n, "modified Grahaml sequence" (sic), see p. 45. LINKS Michael De Vlieger, Table of n, a(n) for n = 0..1908 YĆ¼ksel Soykan, On Generalized Grahaml Numbers, Journal of Advances in Mathematics and Computer Science (2020) Vol. 35, No. 2: 42-57, Article no. JAMCS.55255. Index entries for linear recurrences with constant coefficients, signature (2,3,5). FORMULA G.f.: (x - x^2)/(1 - 2*x - 3*x^2 - 5*x^3). MATHEMATICA LinearRecurrence[{2, 3, 5}, {0, 1, 1}, 29] (* or *) CoefficientList[Series[(x - x^2)/(1 - 2 x - 3 x^2 - 5 x^3), {x, 0, 28}], x] CROSSREFS Cf. A000032, A000045, A000073, A335718, A335719. Sequence in context: A317849 A307572 A325923 * A093374 A258109 A000745 Adjacent sequences:  A335717 A335718 A335719 * A335721 A335722 A335723 KEYWORD nonn,easy AUTHOR Michael De Vlieger, Jun 18 2020 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 January 17 04:08 EST 2022. Contains 350377 sequences. (Running on oeis4.)