The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A163884

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of nXnXn triangular binary arrays with all 1s connected, no 1 having more than 4 1s adjacent, and a path of 1s from peak vertex to anywhere on the bottom side
(history; published version)

#3 by Russ Cox at Sat Mar 31 12:35:32 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Aug 06 2009

Discussion

Sat Mar 31

12:35

OEIS Server: https://oeis.org/edit/global/875

#2 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

KEYWORD

nonn,new

nonn

AUTHOR

Ron R. H. Hardin (rhhardin(AT)att.net) Aug 06 2009

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

NAME

Number of nXnXn triangular binary arrays with all 1s connected, no 1 having more than 4 1s adjacent, and a path of 1s from peak vertex to anywhere on the bottom side

DATA

1, 3, 17, 158, 2798, 95400, 6205642, 775567476, 186046719370

OFFSET

1,2

EXAMPLE

All solutions for n=3

....1......1......1......1......1......1......1......1......1......1......1..

...1.0....1.1....1.0....1.1....1.0....1.1....1.0....1.1....1.0....1.1....1.1.

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

------

....1......1......1......1......1......1..

...0.1....0.1....0.1....0.1....0.1....1.1.

..0.1.0..1.1.0..0.1.1..1.1.1..0.0.1..0.0.1

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Aug 06 2009

STATUS

approved