6613488

Appears in sequences

• a(n) = Sum_{k=0..m} (k+1) * A026082(n, k), where 0 <= k <= m, m=n for n=0,1,2,3; m=2n for n >= 4.at n=13A027319
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.at n=39A071210
• Numbers of multiplicative persistence 7 which are themselves the product of digits of a number.at n=4A350186