|
|
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.
For n>0, a(n) is the number of ways to tile a strip of length n with squares, dominoes, and trominoes, such that there must be exactly one "special" square (say, of a different color) in the first three cells. - Greg Dresden and Emma Li, Aug 17 2024
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (2-x-x^2)/(1-x-x^2-x^3).
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1, 1}, {2, 1, 2}, 34] (* Ray Chandler, Dec 08 2013 *)
|
|
PROG
|
(PARI) my(x='x+O('x^40)); Vec((2-x-x^2)/(1-x-x^2-x^3)) \\ G. C. Greubel, Apr 23 2019
(Magma) R<x>:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (2-x-x^2)/(1-x-x^2-x^3) )); // G. C. Greubel, Apr 23 2019
(Sage) ((2-x-x^2)/(1-x-x^2-x^3)).series(x, 40).coefficients(x, sparse=False) # G. C. Greubel, Apr 23 2019
(GAP) a:=[2, 1, 2];; for n in [4..40] do a[n]:=a[n-1]+a[n-2]+a[n-3]; od; a; # G. C. Greubel, Apr 23 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|