The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A252300

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

Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7
(history; published version)

#4 by R. H. Hardin at Tue Dec 16 15:20:39 EST 2014

STATUS

editing

approved

#3 by R. H. Hardin at Tue Dec 16 15:20:36 EST 2014

LINKS

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

#2 by R. H. Hardin at Tue Dec 16 15:20:21 EST 2014

NAME

allocated for R. H. Hardin

Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7

DATA

1675, 1370, 1677, 2151, 3669, 5416, 7492, 13386, 20379, 28688, 51938, 79730, 112972, 205370, 316178, 449108, 817514, 1260050, 1791652, 3262922, 5031698, 7157828, 13038218, 20110610, 28614532, 52126730, 80410898, 114425348, 208455434

OFFSET

1,1

COMMENTS

Column 3 of A252305

FORMULA

Empirical: a(n) = 7*a(n-3) -14*a(n-6) +8*a(n-9) for n>18

EXAMPLE

Some solutions for n=4

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

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Dec 16 2014

STATUS

approved

editing

#1 by R. H. Hardin at Tue Dec 16 15:16:11 EST 2014

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved