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!)
A147839 a(n)=9*a(n-1)-7*a(n-2), a(0)=1, a(1)=7 . 2

%I #10 Jan 03 2024 08:44:51

%S 1,7,56,455,3703,30142,245357,1997219,16257472,132336715,1077228131,

%T 8768696174,71377668649,581018144623,4729519621064,38498549577215,

%U 313380308847487,2550932932586878,20764734231349493,169026077554037291

%N a(n)=9*a(n-1)-7*a(n-2), a(0)=1, a(1)=7 .

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

%F a(n)=Sum_{k, 0<=k<=n}A147703(n,k)*6^k . G.f.: (1-2x)/(1-9x+7*x^2).

%F a(n)= ((53+5*sqrt(53))/106)*(4.5+0.5*sqrt(53))^n + ((53-5*sqrt(53))/106)*(4.5-0.5*sqrt(53))^n [From _Richard Choulet_, Nov 20 2008]

%t LinearRecurrence[{9,-7},{1,7},30] (* _Harvey P. Dale_, Nov 30 2019 *)

%K nonn

%O 0,2

%A _Philippe Deléham_, Nov 14 2008

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 18 15:35 EDT 2024. Contains 371780 sequences. (Running on oeis4.)