login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A214080
a(n) = (floor(sqrt(n)))!
6
1, 1, 1, 1, 2, 2, 2, 2, 2, 6, 6, 6, 6, 6, 6, 6, 24, 24, 24, 24, 24, 24, 24, 24, 24, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 720, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040, 5040
OFFSET
0,5
LINKS
FORMULA
Sum_{n>=0} 1/a(n) = 3*e. - Amiram Eldar, Aug 15 2022
a(n) = A000142(A000196(n)). - Michel Marcus, Aug 15 2022
MATHEMATICA
Table[Floor[Sqrt[n]]!, {n, 0, 100}] (* T. D. Noe, Dec 23 2012 *)
PROG
(Derive) PROG(y := [], n := 50, LOOP(IF( = -1, RETURN y), y := ADJOIN(FLOOR(SQRT(n))!, y), n := n - 1))
(Magma) [Factorial(Floor(Sqrt(n))): n in [0..60]]; // Vincenzo Librandi, Feb 13 2013
(PARI) a(n) = floor(sqrt(n))!; \\ Altug Alkan, Jan 11 2016
KEYWORD
easy,nonn
AUTHOR
Mohammad K. Azarian, Dec 22 2012
STATUS
approved