A233408 T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with row and column sums nondecreasing, and no adjacent elements equal.

9, 11, 11, 22, 37, 22, 24, 35, 35, 24, 41, 100, 211, 100, 41, 42, 265, 360, 360, 265, 42, 66, 293, 1461, 1907, 1461, 293, 66, 65, 756, 2543, 6931, 6931, 2543, 756, 65, 97, 1937, 8732, 21765, 57941, 21765, 8732, 1937, 97, 93, 2346, 15431, 86233, 216088, 216088

Offset

1,1

Comments

Table starts

..9...11....22......24........41........42.........66.........65........97

.11...37....35.....100.......265.......293........756.......1937......2346

.22...35...211.....360......1461......2543.......8732......15431.....46953

.24..100...360....1907......6931.....21765......86233.....274628....965494

.41..265..1461....6931.....57941....216088....1661918....6745563..44238419

.42..293..2543...21765....216088...1283251...11808072...70311171.571963910

.66..756..8732...86233...1661918..11808072..221737222.1700323455

.65.1937.15431..274628...6745563..70311171.1700323455

.97.2346.46953..965494..44238419.571963910

.93.5788.84143.3146010.186635795

Links

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

Formula

Empirical for column k:

k=1: a(n) = 3*a(n-2) -3*a(n-4) +a(n-6).

Example

Some solutions for n=5, k=4
..2..0..1..0..1....0..1..2..0..2....0..2..0..2..0....1..0..1..2..0
..0..2..0..1..2....1..2..0..2..1....2..0..1..0..1....0..1..2..0..2
..1..0..1..2..1....0..1..2..1..2....0..2..0..2..0....1..2..0..2..0
..0..1..2..1..2....2..0..1..2..1....2..0..2..0..2....2..0..1..0..2
..1..2..1..2..1....0..1..2..1..2....0..2..1..2..1....1..2..0..2..0
..2..1..2..1..2....1..2..1..2..1....2..0..2..0..2....0..1..2..0..2

Crossrefs

Sequence in context: A172283 A172185 A098728 * A107576 A263772 A031954

Adjacent sequences: A233405 A233406 A233407 * A233409 A233410 A233411

Keyword

nonn,tabl

Author

R. H. Hardin, Dec 09 2013

Status

approved