login
a(n) = smallest m such that there exists an m X m (0,1)-matrix with permanent n.
0

%I #7 Feb 20 2024 13:18:59

%S 1,1,2,3,3,4,3,4,4,4,4,4,4,5,4,5,5,5,4,5,5,5,5,5,4,5,5,6,5,5,5,5,5,5,

%T 5,6,5,6,5,5,5,6,6,5,5,6,6,6,6,6,5,6,6,6,5,6,6,6,6,6,6,6,5,6,6,6,6,6,

%U 5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,5,6,6,6,6,6,6,6,6,6,6,6,6,6

%N a(n) = smallest m such that there exists an m X m (0,1)-matrix with permanent n.

%H B. Gordon, T. S. Motzkin, and L. Welch, <a href="https://doi.org/10.1016/0097-3165(74)90001-6">Permanents of 0,1-matrices</a>, J. Combinatorial Theory Ser. A. 17 (1974), 145--155. MR0384828 (52 #5700a)

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Jun 07 2012