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.

A210675 a(n)=a(n-1)+a(n-2)+n+4, a(0)=0, a(1)=1.

This page as a plain text file.
%I A210675 #25 Oct 05 2017 02:54:12
%S A210675 0,1,7,15,30,54,94,159,265,437,716,1168,1900,3085,5003,8107,13130,
%T A210675 21258,34410,55691,90125,145841,235992,381860,617880,999769,1617679,
%U A210675 2617479,4235190,6852702,11087926,17940663,29028625,46969325,75997988,122967352,198965380
%N A210675 a(n)=a(n-1)+a(n-2)+n+4, a(0)=0, a(1)=1.
%H A210675 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-1,1).
%F A210675 a(n) = 3*a(n-1)-2*a(n-2)-a(n-3)+a(n-4). G.f.: x*(4*x^2-4*x-1) / ((x-1)^2*(x^2+x-1)). - _Colin Barker_, May 31 2013
%t A210675 LinearRecurrence[{3, -2, -1, 1}, {0, 1, 7, 15}, 37] (* _Jean-François Alcover_, Oct 05 2017 *)
%Y A210675 Cf. A210673: a(n)=a(n-1)+a(n-2)+n-4, a(0)=0,a(1)=1.
%Y A210675 Cf. A066982: a(n)=a(n-1)+a(n-2)+n-2, a(0)=0,a(1)=1 (except the first term).
%Y A210675 Cf. A104161: a(n)=a(n-1)+a(n-2)+n-1, a(0)=0,a(1)=1.
%Y A210675 Cf. A001924: a(n)=a(n-1)+a(n-2)+n,   a(0)=0,a(1)=1.
%Y A210675 Cf. A192760: a(n)=a(n-1)+a(n-2)+n+1, a(0)=0,a(1)=1.
%Y A210675 Cf. A192761: a(n)=a(n-1)+a(n-2)+n+2, a(0)=0,a(1)=1.
%Y A210675 Cf. A192762: a(n)=a(n-1)+a(n-2)+n+3, a(0)=0,a(1)=1.
%K A210675 nonn,easy
%O A210675 0,3
%A A210675 _Alex Ratushnyak_, May 09 2012