48605

Appears in sequences

• Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.at n=36A074483
• Number of ways to tile an 8 X n rectangle with 1 X 2 and 2 X 2 tiles (i.e., dominoes and squares).at n=4A220869
• Row sums of A342000.at n=19A342020
• Number T(n,k) of tilings of a 2k X n rectangle using dominoes and 2 X 2 tiles.at n=40A352431
• Number of tilings of a 4 X n rectangle using dominoes and 2 X 2 tiles.at n=8A352432