login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085606 a(n) = (n-1)^n - 1. 7

%I #16 May 31 2022 06:47:49

%S 0,-1,0,7,80,1023,15624,279935,5764800,134217727,3486784400,

%T 99999999999,3138428376720,106993205379071,3937376385699288,

%U 155568095557812223,6568408355712890624,295147905179352825855,14063084452067724991008,708235345355337676357631

%N a(n) = (n-1)^n - 1.

%C Sequence relates to the "monkey and coconut problem"(A014293) giving the number of coconuts received by each of the n sailors from the ultimate equitable distribution the next day.

%C From _Alexander Adamchuk_, Nov 13 2006: (Start)

%C 4n^2 divides a(2n).

%C Odd prime p divides a(p-1).

%C 8p^2 divides a(2p) for an odd prime p.

%C 32p^4 divides a(2p^2) for an odd prime p.

%C 64p^8 divides a(2p^4) for an odd prime p.

%C p^3 divides a(p^3+2) for prime p.

%C p divides a((p-1)/2) for prime p in A157437.

%C p^2 divides a((p-1)/2) for prime p = {5,127,607}. (End)

%F a(n) = A065440(n) - 1.

%t Table[(n-1)^n-1,{n,0,30}] (* _Alexander Adamchuk_, Nov 13 2006 *)

%Y Cf. A014293, A007778, A065440, A037205, A157437.

%K sign

%O 0,4

%A _Lekraj Beedassy_, Jul 07 2003

%E More terms from _Ray Chandler_, Nov 10 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)