46871

Appears in sequences

• Number of length n+2 0..2 arrays with the medians of every three consecutive terms nondecreasing.at n=9A250134
• 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=2A254029
• Non-Brauer numbers.at n=32A349044
• 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=25A362359
• a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 4.at n=5A367245