25055

Appears in sequences

• spt(n) - p(n): total number of smallest parts in all partitions of n minus the number of partitions of n.at n=30A215513
• Number of set partitions C'_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks and such that no part contains both 1 and t (each unmarked) or both i and i+1 (each unmarked) for some i with 1 <= i < t; triangle C'_t(n), t>=0, 0<=n<=t, read by rows.at n=42A261319
• Starting at n, a(n) is the number of times we move from a positive spot to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=31A324684
• Starting at n, a(n) is the number of times we move from a positive spot to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=32A324684
• Number of compositions of n that are both a reversed necklace and a co-necklace.at n=21A334271
• Number of integer partitions of n with integer mean and integer median.at n=51A359906
• Number of partitions p of n such that max(p) == 1 mod 3.at n=44A373014