84157

Appears in sequences

• Number of noncrossing connected graphs on n nodes on a circle having no triangular faces.at n=7A045743
• Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=28A089435
• Numbers n for which each of the digits 0-9 appears exactly once as first digit in the orbit of n under iterations of n -> (first digit of n)*(n with first digit removed) until a single digit is reached; no leading zeros allowed.at n=5A257299