

A048764


Largest factorial <= n.


8



1, 2, 2, 2, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


REFERENCES

K. Atanassov, On the 43rd and 44th Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 5 (1999), No. 2, 8688.
J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache fpart of x, Smarandache Notions Journal, Vol. 10, No. 123, 1999, 202204.


LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
K. Atanassov, On Some of Smarandache's Problems
F. Smarandache, Only Problems, Not Solutions!.


FORMULA

a(n) >> n log log n / log n.  Charles R Greathouse IV, Sep 19 2012


MATHEMATICA

Table[k = 1; While[(k + 1)! <= n, k++]; k!, {n, 80}] (* Michael De Vlieger, Aug 30 2016 *)


PROG

(PARI) a(n)=my(t=1, k=1); while(t<=n, t*=k++); t/k \\ Charles R Greathouse IV, Sep 19 2012
(Python)
from sympy import factorial as f
def a(n):
k=1
while f(k + 1)<=n: k+=1
return f(k)
print [a(n) for n in xrange(1, 101)] # Indranil Ghosh, Jun 21 2017, after Mathematica code


CROSSREFS

Cf. A000142.
Sequence in context: A116863 A136494 A260188 * A248782 A038714 A139554
Adjacent sequences: A048761 A048762 A048763 * A048765 A048766 A048767


KEYWORD

nonn,easy


AUTHOR

Charles T. Le (charlestle(AT)yahoo.com)


STATUS

approved



