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!)
A217314 Smallest k such that k! > A000178(n) (the superfactorials). 0

%I #21 Mar 18 2013 15:28:31

%S 2,2,3,4,6,8,11,15,18,23,27,33,38,44,51,58,65,73,81,90,100,109,120,

%T 130,141,153,165,178,191,204,218,233,247,263,279,295,312,329,347,365,

%U 383,402,422,442,462,483,505,527,549,572,595,619,643,668,693,719,745

%N Smallest k such that k! > A000178(n) (the superfactorials).

%H Eric W. Weisstein, <a href="http://mathworld.wolfram.com/Factorial.html">Mathworld: Factorial</a>

%H Eric W. Weisstein, <a href="http://mathworld.wolfram.com/Superfactorial.html">Mathworld: Superfactorial</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Factorial">Factorial</a>

%e SF(4) = 4!*3!*2!*1! = 288, and 5! < 288 < 6! so a(4)=6.

%t a[n_] := Block[{ff = Product[k!, {k, n}], k = 1}, While[k! <= ff, k++]; k]; Table[a[n], {n, 0, 60}] (* _Giovanni Resta_, Mar 18 2013 *)

%o (JavaScript)

%o function factorial(n) {

%o var i,c=1;

%o for (i=2;i<=n;i++) c*=i;

%o return c;

%o }

%o k=1;

%o m=1;

%o for (i=2;i<30;i++) {

%o k*=factorial(i);

%o while (factorial(m)<=k) m++;

%o document.write(m+", ");

%o }

%Y Cf. A000142, A000178.

%K nonn

%O 0,1

%A _Jon Perry_, Mar 17 2013

%E a(27)-a(56) from _Giovanni Resta_, Mar 18 2013

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 August 25 13:57 EDT 2024. Contains 375439 sequences. (Running on oeis4.)