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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145027 a(n)=a(n-1)+a(n-2)+a(n-3) with a(1) = 2, a(2) = 3, a(3) = 4. 2
2, 3, 4, 9, 16, 29, 54, 99, 182, 335, 616, 1133, 2084, 3833, 7050, 12967, 23850, 43867, 80684, 148401, 272952, 502037, 923390, 1698379, 3123806, 5745575, 10567760, 19437141, 35750476, 65755377, 120942994, 222448847, 409147218 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

If the conjectured recurrence in A000382 is correct, then a(n) = A000382(n+2)-A000382(n+1), n>=4. - R. J. Mathar, Jan 30 2011

LINKS

Table of n, a(n) for n=1..33.

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

a(n) = -A000073(n-1)+A000073(n)+2*A000073(n+1). G.f. (1+x)*(x-2)*x / ( -1+x+x^2+x^3 ). - R. J. Mathar, Jan 30 2011

MATHEMATICA

a=2; b=3; c=4; lst={a, b, c}; Do[d=a+b+c; AppendTo[lst, d]; a=b; b=c; c=d, {n, 5!}]; lst

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

CROSSREFS

Cf. A000073, A000213, A001590, A003265, A056816, A081172, A001644.

Sequence in context: A098969 A235401 A281882 * A088275 A274836 A014281

Adjacent sequences:  A145024 A145025 A145026 * A145028 A145029 A145030

KEYWORD

nonn

AUTHOR

Vladimir Joseph Stephan Orlovsky, Sep 30 2008

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 February 22 13:09 EST 2018. Contains 299454 sequences. (Running on oeis4.)