login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214899 a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=2, a(1)=1, a(2)=2. 52
2, 1, 2, 5, 8, 15, 28, 51, 94, 173, 318, 585, 1076, 1979, 3640, 6695, 12314, 22649, 41658, 76621, 140928, 259207, 476756, 876891, 1612854, 2966501, 5456246, 10035601, 18458348, 33950195, 62444144, 114852687, 211247026, 388543857 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

With offset of 5 this sequence is the 4th row of the tribonacci array A136175.

LINKS

Robert Price, Table of n, a(n) for n = 0..200

Martin Burtscher, Igor Szczyrba, RafaƂ Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.

Index entries for linear recurrences with constant coefficients, signature (1,1,1).

FORMULA

G.f. (x^2+x-2)/(x^3+x^2+x-1).

MATHEMATICA

LinearRecurrence[{1, 1, 1}, {2, 1, 2}, 34] (* Ray Chandler, Dec 08 2013 *)

PROG

(PARI) a(n)=([0, 1, 0; 0, 0, 1; 1, 1, 1]^n*[2; 1; 2])[1, 1] \\ Charles R Greathouse IV, Jun 11 2015

CROSSREFS

Cf. A000073, A000213, A035513, A136175, A141036, A141523.

Sequence in context: A052532 A006702 A129394 * A199599 A201163 A049901

Adjacent sequences:  A214896 A214897 A214898 * A214900 A214901 A214902

KEYWORD

nonn,easy

AUTHOR

Abel Amene, Jul 29 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 03:43 EDT 2018. Contains 316275 sequences. (Running on oeis4.)