33665

Appears in sequences

• MacMahon's solid partitions of n in which 4 is the smallest summand.at n=14A002045
• a(n) = Sum_{d divides n} d*2^(n-n/d).at n=11A080267
• a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), with 0 < x_1 <= ... <= x_k = n.at n=23A092666
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=55A136974
• 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, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=10A148782
• Number of bilaterally asymmetric 8-hoops with n symbols and no a-rooted trees.at n=4A210699
• Erroneous version of A210699.at n=4A210768
• Array read by rows: T(m,n) is the number of m-digit semiprimes with last digit n, 0 <= n <= 9.at n=57A374940