OFFSET
0,3
COMMENTS
All terms are odd.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..35
Richard Stanley, Proof of the general conjecture, MathOverflow, March 2021.
FORMULA
a(n) == 1 (mod n*(n-1)) for n >= 2 (see "general conjecture" in A178319 and link to proof by Richard Stanley above).
a(n) ~ n^((n^2 + n - 2)/2). - Vaclav Kotesovec, Jul 15 2021
MAPLE
a:= n-> `if`(n>0, coeff(series(add(n^binomial(j+1, 2)*
x^j/j!, j=0..n)^(1/n), x, n+1), x, n)*n!, 1):
seq(a(n), n=0..12);
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 15 2021
STATUS
approved