1122660

Appears in sequences

• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k leaves (i.e., vertices of degree 0; n>=0, k>=1). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=41A120429
• Numbers n such that 2n-1, 4n-1, 8n-1, 16n-1, 32n-1 and 64n-1 are primes.at n=13A125113
• Indices of records in A339579.at n=3A339580
• a(n) = Sum_{d|n} d^(n/d - d) * binomial(n/d,d).at n=29A376017