login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A163684 Number of n X n binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent 0
1, 3, 17, 132, 1561, 27874, 809249 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

All solutions for n=3

...1.0.0...1.0.0...1.0.0...1.0.0...1.1.0...1.1.0...1.1.1...1.1.1...1.1.0

...1.1.0...1.1.1...1.0.0...1.0.1...1.0.0...1.0.1...1.0.0...1.0.1...0.1.0

...0.1.1...0.0.1...1.1.1...1.1.1...1.1.1...1.1.1...1.1.1...1.1.1...0.1.1

------

...1.1.0...1.1.1...1.1.1...1.1.1...1.1.1...1.1.1...1.0.1...1.1.1

...0.1.1...0.0.1...0.0.1...1.0.1...1.0.1...1.0.1...1.0.1...0.0.1

...0.0.1...0.0.1...0.1.1...0.0.1...0.1.1...1.0.1...1.1.1...1.1.1

CROSSREFS

Sequence in context: A212280 A307680 A305819 * A093986 A192459 A055214

Adjacent sequences:  A163681 A163682 A163683 * A163685 A163686 A163687

KEYWORD

nonn

AUTHOR

R. H. Hardin Aug 03 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)