125491

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=32A000930
• Bisection of A000930.at n=16A002478
• Pisot sequence P(4,6).at n=27A048625
• Pisot sequence P(6,9).at n=26A048626
• Expansion of (1-x)^3/(1 - 4*x + 3*x^2 - x^3).at n=11A052529
• 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=31A068921
• 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=35A078012
• a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=34A099560
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=49A109531
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=46A109532
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=48A109532
• a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=47A109533
• a(n) = n-1, if n <= 2, otherwise A107458(n-1) + A107458(n-2).at n=37A135851
• G.f.: 1/(1+x+x^3).at n=32A199804
• Number of integers m in [0..10^n-1] such that m has no digit in common with the last n digits of either m^2 or m^3.at n=16A256714
• Number of compositions (ordered partitions) of n into triangular numbers not greater than sqrt(n).at n=32A369341
• a(n) = Sum_{k=0..2*n} binomial(2*k,2*n-k).at n=8A391594