cp's OEIS Frontend

A171478 a(n) = 6*a(n-1) - 8*a(n-2) + 2 for n > 1; a(0) = 1, a(1) = 8.

%I A171478 #33 Jul 30 2025 00:58:18
%S A171478 1,8,42,190,806,3318,13462,54230,217686,872278,3492182,13974870,
%T A171478 55911766,223671638,894735702,3579041110,14316361046,57265837398,
%U A171478 229064136022,916258116950,3665035613526,14660148745558,58640607565142
%N A171478 a(n) = 6*a(n-1) - 8*a(n-2) + 2 for n > 1; a(0) = 1, a(1) = 8.
%C A171478 Second binomial transform of A168648.
%C A171478 Partial sums of A080960.
%H A171478 Harvey P. Dale, <a href="/A171478/b171478.txt">Table of n, a(n) for n = 0..1000</a> (extending prior file from Vincenzo Librandi)
%H A171478 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (7,-14,8).
%F A171478 a(n) = (10*4^n - 9*2^n + 2)/3.
%F A171478 G.f.: (1+x)/((1-x)*(1-2*x)*(1-4*x)).
%F A171478 a(0)=1, a(1)=8, a(2)=42, a(n) = 7*a(n-1) - 14*a(n-2) + 8*a(n-3). - _Harvey P. Dale_, May 04 2012
%F A171478 a(n) = A203241(n+1) + 2^n*(2^(n+1)-1), n>0. - _J. M. Bergot_, Mar 21 2018
%p A171478 a:= proc(n) option remember: if n = 0 then 1 elif n = 1 then 8 elif  n >= 2 then 6*procname(n-1) - 8*procname(n-2) + 2 fi; end:
%p A171478 seq(a(n), n = 0..25); # _Muniru A Asiru_, Mar 22 2018
%t A171478 RecurrenceTable[{a[0]==1,a[1]==8,a[n]==6a[n-1]-8a[n-2]+2},a,{n,30}] (* or *) LinearRecurrence[{7,-14,8},{1,8,42},30] (* _Harvey P. Dale_, May 04 2012 *)
%o A171478 (PARI) {m=23; v=concat([1, 8], vector(m-2)); for(n=3, m, v[n]=6*v[n-1]-8*v[n-2]+2); v}
%o A171478 (Magma) [(10*4^n-9*2^n+2)/3: n in [0..30]]; // _Vincenzo Librandi_, Jul 18 2011
%o A171478 (GAP) a:=[1,8];; for n in [3..25] do a[n]:=6*a[n-1]-8*a[n-2]+2; od; a; # _Muniru A Asiru_, Mar 22 2018
%Y A171478 Cf. A168648 ((10*2^n+2*(-1)^n)/3, a(0)=1), A080960 (third binomial transform of A010685), A171472, A171473.
%K A171478 nonn,easy
%O A171478 0,2
%A A171478 _Klaus Brockhaus_, Dec 09 2009