# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a081184
Showing 1-1 of 1
%I A081184 #38 Jan 14 2024 02:29:07
%S A081184 0,1,14,149,1428,12989,114730,995737,8548008,72872473,618458246,
%T A081184 5233409213,44200191420,372832446869,3142245259426,26468308629121,
%U A081184 222870793614672,1876180605036721,15791601170624510,132901927952017253
%N A081184 7th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).
%H A081184 Vincenzo Librandi, Table of n, a(n) for n = 0..200
%H A081184 S. Falcon, Iterated Binomial Transforms of the k-Fibonacci Sequence, British Journal of Mathematics & Computer Science, 4 (22): 2014.
%H A081184 Index entries for linear recurrences with constant coefficients, signature (14,-47).
%F A081184 a(n) = 14*a(n-1) - 47*a(n-2), a(0)=0, a(1)=1.
%F A081184 G.f.: x/(1 - 14*x + 47*x^2). [Corrected by _Georg Fischer_, May 15 2019]
%F A081184 a(n) = ((7 + sqrt(2))^n - (7 - sqrt(2))^n)/(2*sqrt(2)).
%F A081184 a(n) = Sum_{k=0..n} C(n,2*k+1) * 2^k * 7^(n-2*k-1).
%F A081184 E.g.f.: exp(7*x)*sinh(sqrt(2)*x)/sqrt(2). - _Ilya Gutkovskiy_, Aug 12 2017
%t A081184 CoefficientList[Series[x/(1-14*x+47*x^2), {x,0,30}], x] (* _Vincenzo Librandi_, Aug 07 2013 *)
%t A081184 LinearRecurrence[{14,-47},{0,1},30] (* _Harvey P. Dale_, Nov 12 2013 *)
%o A081184 (Magma) [n le 2 select n-1 else 14*Self(n-1)-47*Self(n-2): n in [1..25]]; // _Vincenzo Librandi_, Aug 07 2013
%o A081184 (SageMath)
%o A081184 A081184=BinaryRecurrenceSequence(14,-47,0,1)
%o A081184 [A081184(n) for n in range(31)] # _G. C. Greubel_, Jan 14 2024
%Y A081184 Binomial transform of A081183.
%Y A081184 Cf. A081185.
%K A081184 nonn,easy
%O A081184 0,3
%A A081184 _Paul Barry_, Mar 11 2003
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE