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!)
A049859 a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand; 3 initial terms required. 1

%I #15 Jan 14 2024 17:48:45

%S 0,1,3,4,7,12,23,43,81,151,282,526,982,1833,3422,6388,11925,22261,

%T 41556,77575,144814,270333,504647,942055,1758591,3282868,6128328,

%U 11440120,21355963,39866466,74421140,138926437,259342371,484130068

%N a(n) = Sum_{k=0,1,2,...,n-4,n-2,n-1} a(k); a(n-3) is not a summand; 3 initial terms required.

%H Harvey P. Dale, <a href="/A049859/b049859.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = 2*a(n-1)-a(n-3)+a(n-4); 4 initial terms required.

%F G.f.: x*(x - 1)*(2*x + 1)/(x^4 - x^3 + 2*x - 1). - _Chai Wah Wu_, Jul 29 2020

%t LinearRecurrence[{2,0,-1,1},{0,1,3,4},40] (* _Harvey P. Dale_, Jan 14 2024 *)

%K nonn

%O 0,3

%A _Clark Kimberling_

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 April 16 07:08 EDT 2024. Contains 371698 sequences. (Running on oeis4.)