The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A347611 a(n) is the n-th n-factorial number: a(n) = n!_n. 2
1, 1, 3, 52, 8925, 22661496, 1131162092095, 1375009641495014400, 48378633136349277767794425, 57001313848230245122464621625840000, 2552524038347870310755413660544832496799359491, 4859161865915056755501262525796512204608930674134393036800 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Product_{j=1..n} (n^j-1)/(n-1) for n > 1, a(0) = a(1) = 1.
a(n) = A069777(n,n).
MAPLE
b:= proc(n, k) option remember; `if`(n<2, 1,
b(n-1, k)*(k^n-1)/(k-1))
end:
a:= n-> b(n$2):
seq(a(n), n=0..12);
MATHEMATICA
Array[QFactorial[#, #] &, 12, 0] (* Michael De Vlieger, Sep 09 2021 *)
PROG
(PARI) a(n) = if (n<=1, 1, prod(k=1, n, (n^k-1)/(n-1))); \\ Michel Marcus, Sep 09 2021
(Python)
from math import prod
def a(n):
return 1 if n <= 1 else prod((n**k - 1)//(n - 1) for k in range(1, n+1))
print([a(n) for n in range(12)]) # Michael S. Branicky, Sep 09 2021
CROSSREFS
Main diagonal of A069777.
Sequence in context: A263530 A136723 A202649 * A302932 A364441 A143387
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 08 2021
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 June 8 09:36 EDT 2024. Contains 373217 sequences. (Running on oeis4.)