56805

Appears in sequences

• a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a triangular number.at n=43A214961
• T(n,k) is the number of labeled graphs of n vertices and k edges that have endpoints, where an endpoint is a vertex with degree 1.at n=37A245796
• Sum over all partitions of n of the bitwise OR of the parts.at n=29A306902
• Total number of ways of partitioning n and any natural number less than or equal to n into the same number of parts, not treating partitions of n and itself in a different order as distinct.at n=18A380126