login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285794 a(1)=1, a(2)=2, a(3)=3, a(n) = 3*a(n-3)+2*a(n-2)+a(n-1). 2

%I #10 Apr 27 2017 08:16:51

%S 1,2,3,10,22,51,125,293,696,1657,3928,9330,22157,52601,124905,296578,

%T 704191,1672062,3970178,9426875,22383417,53147701,126195160,299640813,

%U 711474236,1689341342,4011212253,9524317645,22614766177,53697038226,127499523515

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

%H Harvey P. Dale, <a href="/A285794/b285794.txt">Table of n, a(n) for n = 1..1000</a>

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

%F G.f.: x*(x^2-x-1)/(3*x^3+2*x^2+x-1).

%t LinearRecurrence[{1,2,3},{1,2,3},50]

%K nonn

%O 1,2

%A _Harvey P. Dale_, Apr 26 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 13:53 EDT 2024. Contains 372387 sequences. (Running on oeis4.)