42542

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=16A049926
• Number of partitions of n having no parts with multiplicity 9.at n=41A184644
• Number of increasing runs in all Carlitz compositions of n.at n=18A285994