31701

Appears in sequences

• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=25A025106
• Row sums of triangle A049352.at n=6A049377
• Number of partitions of n in which number of least parts is equal to least part.at n=49A096403
• Not appropriate for the OEIS.at n=14A248691
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Sum_{j>=1} (-1)^(j-1)*binomial(-k,j-1)*x^j/j).at n=61A291709