This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110461 a(1) = 5; for n>1, if a(n-1) = nk + r, 0 <= r < n, then a(n) = k^(n-r)*(k+1)^r. 1
 5, 6, 8, 16, 324, 24794911296, 6996029506034747046454468824516730633405603329897709154584282406250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The next term has 528 digits and is too large to include. LINKS EXAMPLE 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. MATHEMATICA A110461 = 5; 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]); Table[A110461[i], {i, 1, 7}] // TableForm (* Keith Schneider (schneidk(AT)email.unc.edu), Jun 14 2007 *) CROSSREFS Sequence in context: A105057 A058336 A285499 * A242913 A191212 A129318 Adjacent sequences:  A110458 A110459 A110460 * A110462 A110463 A110464 KEYWORD base,nonn AUTHOR Amarnath Murthy, Aug 04 2005 EXTENSIONS a(7) from Keith Schneider (schneidk(AT)email.unc.edu), Jun 15 2007 STATUS approved

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

Last modified October 19 22:55 EDT 2019. Contains 328244 sequences. (Running on oeis4.)