43221domain: NAppears in sequencesa(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...).at n=15A025103Number of partitions of n such that the (sum of distinct odd parts) <= n/2.at n=41A284613Number of mutual-visibility sets in the n-prism graph.at n=12A389184