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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190005 a(n) = 6*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1. 3

%I #26 Mar 15 2024 02:25:10

%S 0,1,6,46,336,2476,18216,134056,986496,7259536,53422176,393128416,

%T 2892992256,21289237696,156665348736,1152884469376,8483960303616,

%U 62432606515456,459435242128896,3380937517927936,24879977528856576,183089240352418816,1347335217403078656

%N a(n) = 6*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1.

%H G. C. Greubel, <a href="/A190005/b190005.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (6,10).

%F G.f.: x/(1 - 6*x - 10*x^2). - _R. J. Mathar_, Nov 20 2011

%t LinearRecurrence[{6,10}, {0,1}, 50]

%t CoefficientList[Series[x/(1-6*x-10*x^2), {x, 0, 50}], x] (* _G. C. Greubel_, Jan 11 2018 *)

%o (PARI) x='x+O('x^30); concat([0], Vec(x/(1-6*x-10*x^2))) \\ _G. C. Greubel_, Jan 11 2018

%o (Magma) I:=[0,1]; [n le 2 select I[n] else 6*Self(n-1) + 10*Self(n-2): n in [1..30]]; \\ _G. C. Greubel_, Jan 11 2018

%K nonn,easy

%O 0,3

%A _Vladimir Joseph Stephan Orlovsky_, May 24 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)