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

%I #18 Aug 16 2017 15:43:17

%S 0,1,2,3,5,9,17,32,60,112,209,390,728,1359,2537,4736,8841,16504,30809,

%T 57513,107363,200421,374138,698426,1303794,2433871,4543454,8481540,

%U 15833003,29556423,55174760,102998057,192272694,358927051

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

%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)*(1+x) / ( -1+2*x-x^3+x^4 ). - _R. J. Mathar_, Nov 12 2012

%F a(n) = A059633(n+2)-A059633(n). - _R. J. Mathar_, Aug 16 2017

%o (PARI) a(n)=([0,1,0,0; 0,0,1,0; 0,0,0,1; 1,-1,0,2]^n*[0;1;2;3])[1,1] \\ _Charles R Greathouse IV_, Aug 16 2017

%Y Pairwise sums of A049856. Partial sums of A049864.

%K nonn,easy

%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 25 12:28 EDT 2024. Contains 371969 sequences. (Running on oeis4.)