|
%I M4305 N1800 #31 Jun 16 2023 20:05:05
%S 0,6,240,1020,78120,279930,40353600,134217720,31381059600,99999999990,
%T 34522712143920,106993205379060,51185893014090744,155568095557812210,
%U 98526125335693359360,295147905179352825840,239072435685151324847136
%N In the pile of coconuts problem, the number of coconuts that remain to be shared equally at the end of the process.
%C See A002021 for further description of the problem.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A002022/b002022.txt">Table of n, a(n) for n = 2..100</a>
%H Anonymous, <a href="http://www.f1compiler.com/samples/Sailors%20Monkey%20Coconuts.f1.html">The Monkey and the Coconuts</a> (with FormulaOne program)
%H Santo D'Agostino, <a href="https://qedinsight.wordpress.com/2011/05/13/the-coconut-problem/">“The Coconut Problem”; Updated With Solution</a>, May 2011.
%H R. S. Underwood and Robert E. Moritz, <a href="http://www.jstor.org/stable/2298601">Problem 3242</a>, Amer. Math. Monthly, 35 (1928), 47-48.
%p f := proc(n) if n mod 2 = 1 then RETURN((n-1)^n-(n-1)) else RETURN((n-1)^(n+1)-(n-1)) fi; end:
%t Rest[Table[If[OddQ[n],(n-1)^n-(n-1),(n-1)^(n+1)-(n-1)],{n,30}]] (* _Harvey P. Dale_, Oct 21 2011 *)
%Y Cf. A002021, A006091.
%K nonn,easy,nice
%O 2,2
%A _N. J. A. Sloane_
%E Formula and more terms from _James A. Sellers_, Feb 10 2000
%E Detail added to the name by _Peter Munn_, Jun 16 2023
|
