49635

Appears in sequences

• Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = 1, a(2) = 0.at n=20A081172
• Index k in A095773 where a string of n identical values occurs.at n=39A096183
• a(n) = Sum_{k=0..floor(n/2)} binomial(n,2*k)*Fibonacci(k).at n=15A101890
• Number of n X 2 -1,1 arrays such that the sum over i=1..n, j=1..2 of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 2-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).at n=15A225338
• a(n) = floor(sqrt(F(n+2)^2 + F(n)^2)), where F(n) = A000045(n).at n=22A245271
• Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1.at n=26A336288
• Consecutive internal states of the linear congruential pseudo-random number generator (4096*s + 150889) mod 714025 when started at 1.at n=26A385465