848491

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=37A000930
• Pisot sequence P(4,6).at n=32A048625
• Pisot sequence P(6,9).at n=31A048626
• 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=36A068921
• 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=40A078012
• Expansion of (1 - x)/(1 + x - 2*x^2 + x^3).at n=18A078039
• a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=39A099560
• Expansion of (1-x)/(1-4*x+3*x^2-x^3).at n=12A124820
• a(n) = n-1, if n <= 2, otherwise A107458(n-1) + A107458(n-2).at n=42A135851
• a(0) = 0, a(1) = 1, a(2) = 2; for n > 2, a(n) = a(n-1) + 2*a(n-2) + a(n-3).at n=19A141015
• a(n) = Sum_{k=1..n} b(k)*a(n - k) for n >= 1, where b(n) = b(n-2) + b(n-3) for n >= 3 with b(0) = 0 and b(1) = b(2) = 1.at n=19A141683
• 1 followed by A141015.at n=20A142474