# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a275778
Showing 1-1 of 1

%I A275778 #62 May 31 2020 00:53:21
%S A275778 1,2,1,4,7,12,23,42,77,142,261,480,883,1624,2987,5494,10105,18586,
%T A275778 34185,62876,115647,212708,391231,719586,1323525,2434342,4477453,
%U A275778 8235320,15147115,27859888,51242323,94249326,173351537,318843186,586444049
%N A275778 Tribonacci-like sequence a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3, with a(0) = 1, a(1) = 2, a(2) = 1.
%H A275778 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1).
%F A275778 G.f.: (2 x^2-x-1)/(x^3+x^2+x-1).
%F A275778 a(n) = A276658(n) + A000073(n).
%t A275778 CoefficientList[Series[(-1 - x + 2 x^2)/(-1 + x + x^2 + x^3), {x, 0, 35}], x]
%t A275778 RecurrenceTable[{a[n] == a[n - 1] + a[n - 2] + a[n - 3], a[1] == 1, a[2] == 2, a[3] == 1}, a, {n, 35}]
%t A275778 LinearRecurrence[{1, 1, 1}, {1, 2, 1}, 35]
%o A275778 (PARI) a(n)=([0,1,0; 0,0,1; 1,1,1]^n*[1;2;1])[1,1] \\ _Charles R Greathouse IV_, Sep 10 2016
%Y A275778 Cf. A000073, A276658.
%K A275778 nonn,easy
%O A275778 0,2
%A A275778 _Nicolas Bègue_, Sep 10 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE