34210

Appears in sequences

• Number of compact-rooted directed animals of size n having 3 source points.at n=9A005775
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2.at n=45A102402
• a(n) = prime(n)_prime(n).at n=41A122622
• Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process.at n=21A122768
• Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^(k-1) + ... + d(0)*10^0 and consider the transform T(n) = k*10^d(k) + (k-1)*10^d(k-1) + ... + 0*10^d(0). a(n) gives the fixed points of the transform T(n).at n=28A226767
• a(n) is the number of edges formed by n-secting the angles of a decagon.at n=28A335802