login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n)=a(n-1)+3a(n-2)+a(n-3).
0

%I #12 Jan 02 2024 08:58:05

%S 1,1,1,5,9,25,57,141,337,817,1969,4757,11481,27721,66921,161565,

%T 390049,941665,2273377,5488421,13250217,31988857,77227929,186444717,

%U 450117361,1086679441,2623476241,6333631925,15290740089,36915112105,89120964297

%N a(n)=a(n-1)+3a(n-2)+a(n-3).

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,1)

%F O.g.f.: (-1+3*x^2)/{(1+x)(x^2+2*x-1)} . a(n) = (-1)^(n+1)+2*A000129(n-1) if n>=1. - _R. J. Mathar_, Mar 17 2008

%t LinearRecurrence[{1,3,1},{1,1,1},40] (* _Harvey P. Dale_, Feb 27 2020 *)

%Y Cf. A097076.

%K nonn,easy

%O 0,4

%A _Paul Curtz_, Mar 04 2008