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!)
A308820 a(n) = Product_{k=1..n} ceiling(n/k)!. 1
1, 2, 12, 96, 2880, 34560, 5806080, 92897280, 25082265600, 2006581248000, 794606174208000, 19070548180992000, 208250386136432640000, 5831010811820113920000, 4198327784510482022400000, 3224315738504050193203200000, 14799609239733590386802688000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Product_{k=1..n-1} Product_{d|k} (d + 1).
a(n) = Product_{k=1..n-1} (k + 1)^floor((n-1)/k). - Ridouane Oudra, Apr 10 2023
MAPLE
seq(mul(ceil(n/k)!, k=1..n), n=1..30); # Ridouane Oudra, Apr 10 2023
MATHEMATICA
a[n_] := Product[Ceiling[n/k]!, {k, 1, n}]; Table[a[n], {n, 1, 17}]
PROG
(PARI) a(n) = prod(k=1, n, ceil(n/k)!); \\ Michel Marcus, Jun 27 2019
(Magma) [(&*[Factorial(Ceiling(n/(n-j+1))): j in [1..n]]): n in [1..20]]; // G. C. Greubel, Mar 08 2023
(SageMath)
def A308820(n): return product( factorial(ceil(n/(n-k+1))) for k in range(1, n+1))
[A308820(n) for n in range(1, 21)] # G. C. Greubel, Mar 08 2023
CROSSREFS
Sequence in context: A340938 A059864 A095338 * A322717 A219538 A245897
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jun 26 2019
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 26 23:42 EDT 2024. Contains 375462 sequences. (Running on oeis4.)