69090
domain: N
Appears in sequences
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves.at n=40A055364
- Numbers n such that every digit of n and n-th prime contains a loop (only digits 0,4,6,8,9 in n and n-th prime).at n=28A107624
- Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n.at n=28A211978
- a(n) = cpg(3, n) + cpg(4, n) + ... + cpg(n, n) where cpg(m, n) is the n-th m-th-order centered polygonal number.at n=23A257052