|
%I #6 Jun 22 2020 19:30:37
%S 3,2,10,41,122,417,1405,4671,15642,52322,174925,585026,1956437,
%T 6542577,21879595,73169106,244689882,818285057,2736485290,9151275161,
%U 30603431477,102343114887,342252900010,1144552302066,3827578878597,12800079163442,42805656473005,143149444829321
%N a(n) = 2*a(n-1) + 3*a(n-2) + 5*a(n-3), a(0) = 3, a(1) = 2, a(2) = 10.
%C In Soykan (2020), this sequences is referred to as H_n, "Grahaml-Lucas sequence" (sic), see p. 45.
%H Michael De Vlieger, <a href="/A335719/b335719.txt">Table of n, a(n) for n = 0..1907</a>
%H Yüksel Soykan, <a href="https://doi.org/10.9734/JAMCS/2020/v35i230248">On Generalized Grahaml Numbers</a>, Journal of Advances in Mathematics and Computer Science (2020) Vol. 35, No. 2: 42-57, Article no. JAMCS.55255.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,3,5).
%F G.f.: (3 - 4*x - 3*x^2)/(1 - 2*x - 3*x^2 - 5*x^3).
%t LinearRecurrence[{2, 3, 5}, {3, 2, 10}, 28] (* or *)
%t CoefficientList[Series[(3 - 4 x - 3 x^2)/(1 - 2 x - 3 x^2 - 5 x^3), {x, 0, 27}], x]
%Y Cf. A000032, A000045, A000073, A335718, A335720.
%K nonn,easy
%O 0,1
%A _Michael De Vlieger_, Jun 18 2020
|
