%I #7 Mar 27 2014 23:56:07
%S 5,6,8,16,324,24794911296,
%T 6996029506034747046454468824516730633405603329897709154584282406250
%N a(1) = 5; for n>1, if a(n-1) = nk + r, 0 <= r < n, then a(n) = k^(n-r)*(k+1)^r.
%C The next term has 528 digits and is too large to include.
%e a(2) = 2*3 = 6, a(3) = 2*2*2 = 8, a(4) =2*2*2*2 =16, a(5) = 3*3*3*3*4 = 324.
%t A110461[1] = 5;
%t A110461[n_] := A110461[n] = Times @@ (Table[Floor[A110461[n - 1]/ n], {i, 1, n}] + PadLeft[Table[1, {i, 1, Mod[A110461[n - 1], n]}], n]);
%t Table[A110461[i], {i, 1, 7}] // TableForm (* Keith Schneider (schneidk(AT)email.unc.edu), Jun 14 2007 *)
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Aug 04 2005
%E a(7) from Keith Schneider (schneidk(AT)email.unc.edu), Jun 15 2007