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!)
A178464 Minimal number of lines that must be removed from an n X n square array of cells in order to break all rectangles. 0

%I #7 Mar 30 2012 16:51:57

%S 1,3,7,11,18,25,34,43,55,67,82,97

%N Minimal number of lines that must be removed from an n X n square array of cells in order to break all rectangles.

%C See Gardner for precise definition.

%D M. Gardner, Mathematical Carnival, Random House, NY, 1975; page 120.

%e To illustrate a(2) = 3: remove edges A, B and C:

%e --A----

%e | | |

%e -----B-

%e | C |

%e -------

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Dec 23 2010

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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)