93746

Appears in sequences

• Number of base 32 circular n-digit numbers with adjacent digits differing by 1 or less.at n=9A124804
• Numbers with all different digits such that each digit leaves the same nonzero remainder when each is divided into the number.at n=29A152852
• Positive solutions of Monkey and Coconuts Problem for the classic case (5 sailors, 1 coconut to the monkey): a(n) = 15625*n - 4 for n >= 1.at n=5A254029
• Triangle T read by rows, obtained from the array A for the solutions of the Monkey and Coconuts Problem (s sailors and one coconut to the monkey).at n=49A362359