30759

Appears in sequences

• Sums of distinct powers of 13.at n=25A033049
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, 0), (0, 1, -1), (1, 0, 1)}.at n=9A149322
• a(n) = 4*n^3 - 3*n^2 - 2*n - 1.at n=20A268644
• Number of subsets of {1..n} containing some element equal to the sum of two or more distinct other elements. A variation of sum-full subsets without re-used elements.at n=15A364534
• a(n) = (A084218(n) - 1)/12.at n=25A373040
• a(n) is the least positive integer k such that k! has exactly n infinitary divisors that are factorials, or -1 if no such number exists.at n=20A375638