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.

A254029

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.

Terms

    a(0) =15621a(1) =31246a(2) =46871a(3) =62496a(4) =78121a(5) =93746a(6) =109371a(7) =124996a(8) =140621a(9) =156246a(10) =171871a(11) =187496a(12) =203121a(13) =218746a(14) =234371a(15) =249996a(16) =265621a(17) =281246a(18) =296871a(19) =312496a(20) =328121a(21) =343746a(22) =359371a(23) =374996a(24) =390621a(25) =406246a(26) =421871a(27) =437496a(28) =453121a(29) =468746

External references