A089477 Smallest positive integer not the permanent of a real {0,1}-matrix of order n.

2, 3, 5, 13, 27, 119, 737

Offset

1,1

Comments

a(6) from Gordon F. Royle.

Links

Table of n, a(n) for n=1..7.

Swee Hong Chan and Igor Pak, Computational complexity of counting coincidences, arXiv:2308.10214 [math.CO], 2023. See p. 4.

Example

a(2)=3 because {0,1,2} are expressible as permanents of (0, 1)-matrices.

Crossrefs

Cf. A089479 occurrence counts for permanents of (0, 1)-matrices, A087983 number of different values taken by permanent of (0, 1)-matrix, A013588 smallest number not expressible as determinant of (0, 1)-matrix.

Sequence in context: A072537 A357916 A289758 * A099962 A173718 A281316

Adjacent sequences: A089474 A089475 A089476 * A089478 A089479 A089480

Keyword

hard,more,nonn

Author

Hugo Pfoertner, Nov 05 2003

Extensions

a(7) from Giovanni Resta, Mar 29 2006

Status

approved