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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A130797 a(1)=1; for n >= 2, a(n) = floor(n!/(Sum_{k=1..n-1} a(k))). 1
 1, 2, 2, 4, 13, 32, 93, 274, 861, 2830, 9707, 34662, 128442, 492747, 1952714, 7978537, 33552502, 145002884, 643093018, 2923285048, 13604173759, 64747674282, 314856179539, 1562985778041, 7914087230121, 40843626440195, 214695804264578, 1148729745111018, 6252380887804219 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..800 MAPLE a[1]:=1: for n from 2 to 27 do a[n]:=floor(factorial(n)/(sum(a[k], k=1..n-1))) end do: seq(a[n], n = 1 .. 27); # Emeric Deutsch, Jul 22 2007 MATHEMATICA a={1}; For[n=2, n<50, n++, AppendTo[a, Floor[n!/Sum[a[[i]], {i, 1, n - 1}]]]]; a (* Stefan Steinerberger, Jul 16 2007 *) f[l_] := Append[l, Floor[(Length[l] + 1)!/(Plus @@ l)]], Nest[f, {1}, 26] (* Robert G. Wilson v *) CROSSREFS Sequence in context: A098774 A009264 A048157 * A362262 A248238 A268009 Adjacent sequences: A130794 A130795 A130796 * A130798 A130799 A130800 KEYWORD nonn AUTHOR Leroy Quet, Jul 15 2007 EXTENSIONS More terms from Stefan Steinerberger, Emeric Deutsch and Joshua Zucker, Jul 16 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 23:06 EST 2023. Contains 367696 sequences. (Running on oeis4.)