151432

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=32A024463
• Total of n-colorings of parts of all integer partitions of n.at n=8A178887
• Principal diagonal of the convolution array A213768.at n=16A213769
• G.f. A(x) satisfies [x^(2*n)] A(x)^(3*n) = 3 and [x^(2*n+1)] A(x)^(3*n+1) = [x^(2*n+1)] A(x)^(3*n+2) for n >= 1.at n=10A377095