82902

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=18A049916
• Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=48A240308