58425

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=30A000930
• Bisection of A000930.at n=15A002478
• Pisot sequence P(4,6).at n=25A048625
• Pisot sequence P(6,9).at n=24A048626
• Expansion of (1-x)^2/(1 - 4*x + 3*x^2 - x^3).at n=10A052544
• 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=29A068921
• 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=33A078012
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=46A109531
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=48A109531
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=43A109532
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=45A109532
• a(n)= +a(n-3) +2*a(n-6) +a(n-9).at n=47A109532
• a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=44A109533
• a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=49A109533
• a(n) = n-1, if n <= 2, otherwise A107458(n-1) + A107458(n-2).at n=35A135851
• a(n) = (2*n^3 + 5*n^2 - 3*n)/2.at n=37A162256
• G.f.: 1/(1+x+x^3).at n=30A199804
• INVERT transform of [1, 0, 1, 3, 9, 27, 81, ...].at n=11A204200
• Number of compositions (ordered partitions) of n into triangular numbers not greater than sqrt(n).at n=30A369341