37513

Appears in sequences

• a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k,2k).at n=24A005252
• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.at n=24A050787
• Triangle of T(n,k) where T(n,k)/(n-1)! is probability of player k out of n players winning a game of "Elimination": rules are that player 1 chooses one of the others at random to be eliminated, then player 2 (or 3 if player 2 has been eliminated) chooses somebody else at random from the survivors to be eliminated next, then the next surviving player chooses and so on round the circle until all but one have been eliminated.at n=51A071818
• a(n) = floor((Fibonacci(2*n+1)+1)/2).at n=12A087953
• A Fibonacci convolution.at n=24A094686
• Expansion of (1-x+x^2)/(1-2x+2x^2-x^3-x^4).at n=31A096750
• a(n) = floor[(phi + n mod 2)*a(n-1)], a(1)=1.at n=16A107857
• a(n) = b(k), where b(k) = Fibonacci(n-1) and k = floor( n*(1+sqrt(5))/2 ).at n=16A107858
• Antidiagonal sums of number triangle A086645.at n=12A108479
• Expansion of (1-x)^3/(1-4x+5x^2-4x^3+x^4).at n=12A109961
• a(n) = Sum_{k <= n/2} binomial(n-2k, 3k+2).at n=21A137358
• Number of nonnegative even integers <= Fibonacci(n).at n=25A147997
• Partial sums of A151782.at n=33A151793
• a(n) = ceiling(Fibonacci(n)/2).at n=25A173173
• a(n) = (A000045(n)+A173432(n))/2.at n=24A173433
• a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.at n=51A173673
• For n odd a(n) = a(n-2) + a(n-3), for n even a(n) = a(n-2) + a(n-5); with a(1) = 0, a(2) = 1.at n=49A174618
• Number of 5-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n.at n=30A208972
• Expansion of (1-3*x)/(1-5*x+3*x^2+x^3).at n=8A232970
• a(n) = 3*a(n-1) + 5*a(n-2) + a(n-3), with a(0) = a(1) = 1 and a(2) = 7, a linear recurrence which is a trisection of A005252.at n=8A294262