43112

Appears in sequences

• Number of ways to partition n elements into pie slices of different sizes of at least 2 allowing the pie to be turned over.at n=46A032230
• a(1) = 1; for n>1, a(n) = smallest number that is not a sum or product of any subset of the numbers a(1) to a(n-1).at n=18A065026
• 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, -1), (-1, -1, 0), (-1, -1, 1), (-1, 0, 1), (1, 1, 0)}.at n=10A149089
• Number of 4-step self-avoiding walks on an n X n square summed over all starting positions.at n=35A188149