106852

Appears in sequences

• Lexicographically earliest infinite sequence such that (a(i)-a(j)) mod (a(k)-a(j)) is nonzero whenever i,j,k are disjoint.at n=18A178850
• Number A(n,k) of partitions of n^k into parts that are at most n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=41A238016
• Number of partitions of n^3 into parts that are at most n.at n=5A238608
• Number of partitions of 5^n into parts that are at most 5.at n=3A238632
• Number of partitions of 5n into 5 parts.at n=26A256225
• Number of partitions of 5*n^2 into parts that are at most n.at n=5A258295