OFFSET
3,1
COMMENTS
a(n) is an upper bound for the length of a minimal superpermutation on n symbols (see links). A lower bound is given by A376269(n). - Paolo Xausa, Sep 27 2024
LINKS
Michael De Vlieger, Table of n, a(n) for n = 3..449
Michael Engen and Vincent Vatter, Containing all permutations, Amer. Math. Monthly, 128 (2021), 4-24; arXiv preprint, arXiv:1810.08252 [math.CO], 2018-2020.
Wikipedia, Superpermutation.
FORMULA
a(n) = (n-3)!*(n^2*(n-2) + 1) + n - 3. - Chai Wah Wu, Sep 20 2024
MATHEMATICA
Array[Total[(# - Range[0, 3])!] + # - 3 &, 20, 3] (* Michael De Vlieger, Apr 07 2021 *)
PROG
(Python)
from sympy import factorial
def A341300(n): return (n**2*(n-2)+1)*factorial(n-3)+n-3 # Chai Wah Wu, Sep 20 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 13 2021
STATUS
approved