42707

Appears in sequences

• a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=42A063676
• Number of partitions of n such that some part is a sum of two or more other parts.at n=41A237668
• Number of leaf-balanced trees with n nodes.at n=20A291443
• Total number of nodes summed over all nonnegative lattice paths from (0,0) to (n,0) where the allowed steps at (x,y) are (h,v) with h in {1..max(1,y)} and v in {-1,0,1}.at n=10A337318