cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A190560 a(n) = 8*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.

This page as a plain text file.
%I A190560 #25 Mar 08 2024 01:15:05
%S A190560 0,1,8,70,608,5284,45920,399064,3468032,30138640,261917312,2276170336,
%T A190560 19780866560,171903954496,1493916835328,12982758409600,
%U A190560 112825568288768,980501096767744,8520962183874560,74050704051602944,643531405516070912,5592555468438184960
%N A190560 a(n) = 8*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.
%H A190560 G. C. Greubel, <a href="/A190560/b190560.txt">Table of n, a(n) for n = 0..1000</a>
%H A190560 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8,6).
%F A190560 G.f.:  x/(1 - 8*x - 6*x^2). - _R. J. Mathar_, Nov 21 2011
%t A190560 LinearRecurrence[{8,6}, {0,1}, 50]
%t A190560 CoefficientList[Series[x/(1-8 x-6 x^2),{x,0,30}],x] (* _Harvey P. Dale_, May 06 2021 *)
%o A190560 (PARI) x='x+O('x^30); concat([0], Vec(x/(1-8*x-6*x^2))) \\ _G. C. Greubel_, Jan 15 2018
%o A190560 (Magma) I:=[0,1]; [n le 2 select I[n] else 8*Self(n-1) + 6*Self(n-2): n in [1..30]]; // _G. C. Greubel_, Jan 15 2018
%K A190560 nonn
%O A190560 0,3
%A A190560 _Vladimir Joseph Stephan Orlovsky_, May 24 2011