210490

Appears in sequences

• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531.at n=21A024313
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor(n/2), s = (natural numbers >= 3), t = (Fibonacci numbers).at n=20A024315
• Sequence associated to the recurrence b(n) = b(n-1) + 3*b(n-2).at n=6A110111
• Square array of numbers associated to the recurrences b(k) = b(k-1) + n*b(k-2); array T(n,k), read by descending antidiagonals, for n, k >= 0.at n=39A110112
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=3.at n=39A172347
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=3.at n=41A172347