The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A254908

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

Number of (2+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally
(history; published version)

#4 by R. H. Hardin at Tue Feb 10 09:54:36 EST 2015

STATUS

editing

approved

#3 by R. H. Hardin at Tue Feb 10 09:54:31 EST 2015

LINKS

R. H. Hardin, <a href="/A254908/b254908.txt">Table of n, a(n) for n = 1..210</a>

#2 by R. H. Hardin at Tue Feb 10 09:54:14 EST 2015

NAME

allocated for R. H. Hardin

Number of (2+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally

DATA

2423, 5939, 14137, 40492, 109250, 258031, 576326, 1231872, 2547861, 5124950, 10170603, 19679796, 37067302, 68991907, 127544546, 232985318, 421049046, 754742881, 1343411988, 2377050180, 4185913747, 7337463337, 12807179775

OFFSET

1,1

COMMENTS

Row 2 of A254907

EXAMPLE

Some solutions for n=4

..1..0..0..1..1..0....0..1..0..0..0..1....1..1..1..1..0..1....1..0..0..1..1..0

..1..0..0..0..0..0....1..0..0..1..0..1....1..0..1..1..1..0....1..0..0..1..0..1

..0..0..0..0..1..1....1..0..0..0..0..1....1..1..1..0..1..0....0..0..0..1..1..1

..0..1..1..1..1..1....0..1..1..0..1..1....0..1..1..1..1..1....0..1..1..1..1..1

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Feb 10 2015

STATUS

approved

editing

#1 by R. H. Hardin at Tue Feb 10 09:38:29 EST 2015

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved