2670964

Appears in sequences

• Narayana's cows sequence: a(0) = a(1) = a(2) = 1; thereafter a(n) = a(n-1) + a(n-3).at n=40A000930
• Bisection of A000930.at n=20A002478
• Pisot sequence P(4,6).at n=35A048625
• Pisot sequence P(6,9).at n=34A048626
• Number of ways to tile a 2 X n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=39A068921
• a(n) = a(n-1) + a(n-3) for n >= 3, with a(0) = 1, a(1) = a(2) = 0. This recurrence can also be used to define a(n) for n < 0.at n=43A078012
• a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=42A099560
• Expansion of (1-x)/(1-4*x+3*x^2-x^3).at n=13A124820
• a(n) = n-1, if n <= 2, otherwise A107458(n-1) + A107458(n-2).at n=45A135851
• G.f.: 1/(1+x+x^3).at n=40A199804
• a(n) = Sum_{k=0..2*n} binomial(2*k,2*n-k).at n=10A391594