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!)
A152621 a(n)=8*a(n-1)-6*a(n-2), n>1 ; a(0)=1, a(1)=2. 1

%I #13 Jan 03 2024 08:46:08

%S 1,2,10,68,484,3464,24808,177680,1272592,9114656,65281696,467565632,

%T 3348834880,23985285248,171789272704,1230402470144,8812484124928,

%U 63117458178560,452064760678912,3237813336359936,23190118126806016

%N a(n)=8*a(n-1)-6*a(n-2), n>1 ; a(0)=1, a(1)=2.

%C Unsigned version of A152620.

%H Harvey P. Dale, <a href="/A152621/b152621.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 (8,-6)

%F G.f.: (1-6*x)/(1-8*x+6*x^2).

%t LinearRecurrence[{8,-6},{1,2},30] (* _Harvey P. Dale_, Jun 19 2022 *)

%K nonn,easy

%O 0,2

%A _Philippe Deléham_, Dec 10 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 March 29 06:34 EDT 2024. Contains 371265 sequences. (Running on oeis4.)