204174

Appears in sequences

• a(1)=1; a(n) = Sum_{1<=k<n, gcd(k,n(n+1)/2)=1} a(k).at n=29A125597
• a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.at n=49A292726