OFFSET
0,3
COMMENTS
a(n) is the number of labeled deterministic finite automata with n states, 2 letters, and one start and one accept state. - Anand Jain, Mar 20 2025
MAPLE
a:=n->mul(n^2, k=0..n):seq(a(n), n=0..14); # Zerinvary Lajos, Jan 26 2008
MATHEMATICA
Table[n^(2n+2), {n, 0, 20}] (* Harvey P. Dale, Jun 04 2021 *)
PROG
(PARI) a(n) = n^(2*n + 2); \\ Michel Marcus, Jan 16 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 05 2003
STATUS
approved
