login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213251 a(n) = smallest m such that there exists an m X m (0,1)-matrix with permanent n. 0
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
B. Gordon, T. S. Motzkin, and L. Welch, Permanents of 0,1-matrices, J. Combinatorial Theory Ser. A. 17 (1974), 145--155. MR0384828 (52 #5700a)
CROSSREFS
Sequence in context: A085887 A305716 A297616 * A049108 A179846 A086925
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 07 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 22:12 EDT 2024. Contains 375550 sequences. (Running on oeis4.)