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.

A107300 a(n) = 2*a(n-1) + 2*a(n-2) - 2*a(n-3) with a(0)=3, a(1)=2, a(3)=8.

This page as a plain text file.
%I A107300 #7 May 02 2022 03:03:58
%S A107300 3,2,8,14,40,92,236,576,1440,3560,8848,21936,54448,135072,335168,
%T A107300 831584,2063360,5119552,12702656,31517696,78201600,194033280,
%U A107300 481434368,1194532096,2963866368,7353928192
%N A107300 a(n) = 2*a(n-1) + 2*a(n-2) - 2*a(n-3) with a(0)=3, a(1)=2, a(3)=8.
%H A107300 G. C. Greubel, <a href="/A107300/b107300.txt">Table of n, a(n) for n = 0..1000</a>
%H A107300 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,2,-2).
%F A107300 G.f.: (3-4*x-2*x^2)/(1-2*x-2*x^2+2*x^3). [Sep 28 2009]
%F A107300 a(n) = 3*A077937(n) - 4*A077937(n-1) - 2*A077937(n-2). [Sep 28 2009]
%F A107300 a(n) = 2*(b1^n + b2^n + b3^n)/(b1 + b2 + b3), where b1, b2, and b3 and the roots of x^3 = 2*x^2 + 2*x - 2.
%t A107300 LinearRecurrence[{2,2,-2}, {3,2,8}, 46]
%o A107300 (Magma) I:=[3,2,8]; [n le 3 select I[n] else 2*(Self(n-1) +Self(n-2) -Self(n-3)): n in [1..46]]; // _G. C. Greubel_, May 02 2022
%o A107300 (SageMath)
%o A107300 def A107300_list(prec):
%o A107300     P.<x> = PowerSeriesRing(ZZ, prec)
%o A107300     return P( (3-4*x-2*x^2)/(1-2*x-2*x^2+2*x^3) ).list()
%o A107300 A107300_list(45) # _G. C. Greubel_, May 02 2022
%Y A107300 Cf. A077937.
%K A107300 nonn,easy
%O A107300 0,1
%A A107300 _Roger L. Bagula_, May 20 2005
%E A107300 Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009