30470

Appears in sequences

• Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=35A096223
• Intersection of A108027, A108028, A108029 and A108030.at n=14A108109
• 7th column of the array A172119.at n=15A172316
• Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=7.at n=21A228644
• Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are in (weakly) increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=24A321296
• Number of ways of having a total of n coins in your two pockets (each of them either a penny, a nickel, a dime, or a quarter), so that the amounts in the pockets are identical.at n=30A323825
• Number of colored set partitions of [2n] where colors of the elements of subsets are in (weakly) increasing order and exactly n colors are used.at n=3A325889