27201

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=28A000930
• Bisection of A000930.at n=14A002478
• Number of elements in Z[ i ] whose 'smallest algorithm' is <= n.at n=11A006457
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones.at n=34A031866
• Denominators of continued fraction convergents to sqrt(761).at n=12A042467
• Pisot sequence P(4,6).at n=23A048625
• Pisot sequence P(6,9).at n=22A048626
• 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=27A068921
• 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=31A078012
• a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=30A099560
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=43A109531
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=45A109531
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=40A109532
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=42A109532
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=44A109532
• a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=41A109533
• a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=46A109533
• Expansion of (1-x)/(1-4*x+3*x^2-x^3).at n=9A124820
• a(n) = n-1, if n <= 2, otherwise A107458(n-1) + A107458(n-2).at n=33A135851
• a(n) = 68*n^2 + 1.at n=20A158732