1106028

Appears in sequences

• Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.at n=41A114506
• Larger member of each exponential amicable pair.at n=3A126166
• Exponential amicable numbers.at n=7A127659
• Integers whose exponential aliquot sequences end in an exponential amicable pair.at n=7A127660