OFFSET
1,1
LINKS
Swee Hong Chan and Igor Pak, Computational complexity of counting coincidences, arXiv:2308.10214 [math.CO], 2023. See p. 4.
Yaroslav Shitov, The range of 0-1 permanents, ResearchGate, November 2025. See p. 13.
EXAMPLE
a(2)=3 because {0,1,2} are expressible as permanents of (0, 1)-matrices.
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Hugo Pfoertner, Nov 05 2003
EXTENSIONS
a(6) from Gordon Royle
a(7) from Giovanni Resta, Mar 29 2006
a(8) from Minfeng Wang, Oct 04 2024
a(9) from Yaroslav Shitov added by Stefano Spezia, Dec 01 2025
STATUS
approved
