We want to tile an n × 1 strip with tiles of two types: 1 × 1 tiles that are dark-blue light-blue. and red, and 2 × 1 green tiles. Give a formula for the number of such tilings Tn, considering that blue tiles cannot be next to each other. Your solution must include a recurrence equation (with initial conditions!), a . You do not need to solve it

eveidence i thing that

step-by-step explanation:

homozygous. one is homozygous, while two is heterozygous.

no oblique asymptote

step-by-step explanation:

to find the oblique asymptote of f(x)

here numerator has degree 1 and denomintor degree 2

degree of numerator < degree of denominator

hence there is no oblique asymptote

when the degree of the denominator > that of the numerator, we saw that the value in the denominator got so much bigger, so quickly,   giving us a horizontal asymptote of the x-axis. or we can write

f(x) = a polynomial of x + a proper fraction.

in this case only we have oblique asymptotes but not when numerator has less degree.

i believe it’s 165 because if u add 137 and 58 u get 195 and then subtract that from 360 and there’s ur answer