The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A205942

Number of (n+1) X 7 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.
(history; published version)

#9 by Wesley Ivan Hurt at Sat Sep 03 22:01:26 EDT 2022

STATUS

editing

approved

#8 by Wesley Ivan Hurt at Sat Sep 03 22:01:16 EDT 2022

CROSSREFS

Cf. A205944.

STATUS

approved

editing

#7 by Jon E. Schoenfield at Thu Dec 10 02:05:09 EST 2015

STATUS

editing

approved

#6 by Jon E. Schoenfield at Thu Dec 10 02:05:08 EST 2015

NAME

Number of (n+1)X7 X 7 0..3 arrays with no 2X2 2 X 2 subblock having the number of clockwise edge increases equal to the number of anticlockwise counterclockwise edge increases in its adjacent leftward or upward neighbors.

COMMENTS

Column 6 of A205944.

EXAMPLE

Some solutions for n=4:

AUTHOR

R. H. Hardin , Feb 01 2012

STATUS

approved

editing

#5 by Russ Cox at Sat Mar 31 12:37:09 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Feb 01 2012

Discussion

Sat Mar 31

12:37

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

#4 by Ron Hardin at Wed Feb 01 20:21:33 EST 2012

STATUS

editing

approved

#3 by Ron Hardin at Wed Feb 01 20:21:31 EST 2012

LINKS

R. H. Hardin, <a href="/A205942/b205942.txt">Table of n, a(n) for n = 1..22</a>

#2 by Ron Hardin at Wed Feb 01 20:21:11 EST 2012

NAME

allocated for Ron HardinNumber of (n+1)X7 0..3 arrays with no 2X2 subblock having the number of clockwise edge increases equal to the number of anticlockwise edge increases in its adjacent leftward or upward neighbors

DATA

4711264, 34647764, 519841120, 6909160028, 103395482496, 1498787263308, 22850275822056, 350243656458156, 5398960736044656, 84190508155837176, 1298216839771776032, 20181211947687559772, 312919261125294119584

OFFSET

1,1

COMMENTS

Column 6 of A205944

EXAMPLE

Some solutions for n=4

..1..2..2..1..0..1..2....0..2..0..3..3..2..0....2..0..0..2..0..3..0

..3..2..2..2..1..1..3....0..2..1..0..2..2..1....2..2..1..3..3..3..1

..0..3..2..2..1..1..0....0..3..2..0..0..3..2....1..3..2..2..3..3..2

..0..0..3..3..2..2..1....1..0..2..2..1..0..2....0..1..2..3..0..0..3

..0..0..3..3..2..2..0....2..0..0..3..2..0..0....0..0..3..0..0..0..2

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Feb 01 2012

STATUS

approved

editing

#1 by Ron Hardin at Wed Feb 01 20:14:23 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved