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.

A153382 a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.

This page as a plain text file.
%I A153382 #22 Apr 24 2024 09:58:43
%S A153382 0,8,10,18,30,48,80,128,210,338,550,888,1440,2328,3770,6098,9870,
%T A153382 15968,25840,41808,67650,109458,177110,286568,463680,750248,1213930,
%U A153382 1964178,3178110,5142288,8320400,13462688,21783090,35245778,57028870,92274648
%N A153382 a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.
%H A153382 Paolo Xausa, <a href="/A153382/b153382.txt">Table of n, a(n) for n = 0..1000</a>
%H A153382 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-1,-1)
%F A153382 From _R. J. Mathar_, Jan 03 2009: (Start)
%F A153382 G.f.: 2x(4+x-4x^2)/((1-x)(1+x)(1-x-x^2)).
%F A153382 a(n) = -2*A000035(n)+10*A000045(n). (End)
%t A153382 LinearRecurrence[{1, 2, -1, -1}, {0, 8, 10, 18}, 50] (* _Paolo Xausa_, Jan 19 2024 *)
%Y A153382 Cf. A000035, A000045.
%K A153382 nonn,easy
%O A153382 0,2
%A A153382 _Paul Curtz_, Dec 25 2008
%E A153382 Extended by _R. J. Mathar_, Jan 03 2009