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!)
A046877 a(n) = a(n-2) + a(n-3). 0

%I #11 Jul 02 2021 10:15:14

%S 3,2,6,5,8,11,13,19,24,32,43,56,75,99,131,174,230,305,404,535,709,939,

%T 1244,1648,2183,2892,3831,5075,6723,8906,11798,15629,20704,27427,

%U 36333,48131,63760,84464,111891,148224,196355,260115,344579

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

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

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

%t LinearRecurrence[{0,1,1},{3,2,6},50] (* _Harvey P. Dale_, Jan 16 2018 *)

%Y Cf. A001608.

%K nonn

%O 0,1

%A _N. J. A. Sloane_

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 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)