Voozh

A206414

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.

81, 423, 423, 2457, 5199, 2457, 15087, 69585, 69585, 15087, 94761, 953865, 2073999, 953865, 94761, 600519, 13148043, 62351943, 62351943, 13148043, 600519, 3818649, 181467207, 1876995285, 4099250889, 1876995285, 181467207, 3818649, 24314127

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Table starts

.......81.........423...........2457.............15087.................94761

......423........5199..........69585............953865..............13148043

.....2457.......69585........2073999..........62351943............1876995285

....15087......953865.......62351943........4099250889..........269845754715

....94761....13148043.....1876995285......269845754715........38883964087761

...600519...181467207....56515649709....17769571483479......5607670598448153

..3818649..2505335985..1701726564411..1170258128101905....808953988411331487

.24314127.34591087977.51240524315871.77072446958972853.116711118064834566675

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..143

EXAMPLE

Some solutions for n=4, k=3:

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

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

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

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

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

CROSSREFS

Sequence in context: A205986 A206668 A238180 * A205979 A206661 A238173

Adjacent sequences: A206411 A206412 A206413 * A206415 A206416 A206417

KEYWORD

nonn,tabl

AUTHOR

R. H. Hardin, Feb 07 2012

STATUS

approved

URL: https://oeis.org/A206414

⇱ A206414 - OEIS