36649
domain: N
Appears in sequences
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...).at n=35A024479
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...).at n=34A025099
- Total sum of parts of multiplicity 9 in all partitions of n.at n=46A222737
- Number of equivalence classes of 3-binomial complexity for binary words of length n.at n=15A258585