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!)
A167704 a(0)=1, a(1)=0, a(2)=2, a(3)=1, a(n)=a(n-2)+a(n-3)+a(n-4) for n>3. 2

%I #10 Jun 21 2016 02:40:59

%S 1,0,2,1,3,3,6,7,12,16,25,35,53,76,113,164,242,353,519,759,1114,1631,

%T 2392,3504,5137,7527,11033,16168,23697,34728,50898,74593,109323,

%U 160219,234814,344135,504356,739168,1083305,1587659,2326829,3410132,4997793,7324620

%N a(0)=1, a(1)=0, a(2)=2, a(3)=1, a(n)=a(n-2)+a(n-3)+a(n-4) for n>3.

%C Diagonal sums of triangle in A122950.

%H G. C. Greubel, <a href="/A167704/b167704.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 (0, 1, 1, 1).

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

%F a(n) = a(n-2) + a(n-3) + a(n-4). - _G. C. Greubel_, Jun 20 2016

%t LinearRecurrence[{0,1,1,1},{1,0,2,1},50] (* _Harvey P. Dale_, Aug 09 2015 *)

%K nonn

%O 0,3

%A _Philippe Deléham_, Nov 10 2009

%E Corrected and extended by _Harvey P. Dale_, Aug 09 2015

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 March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)