38883

Appears in sequences

• Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.at n=38A083958
• Least number k having n representations as the sum of the minimal number of cubes A002376(k).at n=29A163490
• Sum of the sizes of the Durfee squares of all partitions of n that do not contain 1 as a part, but with a(1) = 1.at n=42A208474
• Triangle read by rows: T(n,k) is the number of steps in constructing a tree f(n,k) where f(a,b) = f(f(a-1,b), f(a,b-1)), f(0,b) = f(b-1,b-1), f(a,0) = f(a-1,a-1), f(0,0) = 0; n >= 0, k = 0..n.at n=28A369792