Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A252380

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

Showing all changes.
Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.
(history; published version)
#7 by Alois P. Heinz at Mon Dec 03 10:38:49 EST 2018
STATUS

proposed

approved

#6 by Colin Barker at Mon Dec 03 10:36:48 EST 2018
STATUS

editing

proposed

#5 by Colin Barker at Mon Dec 03 10:36:21 EST 2018
NAME

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

COMMENTS

Column 4 of A252384

FORMULA

Empirical: a(n) = 4*a(n-3) - 4*a(n-6) + a(n-9) for n>12.

Empirical g.f.: x*(1966 + 771*x + 663*x^2 - 7120*x^3 - 2168*x^4 - 1555*x^5 + 6249*x^6 + 1211*x^7 + 534*x^8 - 1458*x^9 - 189*x^10 - 14*x^11) / ((1 - x)*(1 + x + x^2)*(1 - 3*x^3 + x^6)). - Colin Barker, Dec 03 2018

EXAMPLE

Some solutions for n=4:

CROSSREFS

Column 4 of A252384.

STATUS

approved

editing

#4 by R. H. Hardin at Wed Dec 17 08:51:48 EST 2014
STATUS

editing

approved

#3 by R. H. Hardin at Wed Dec 17 08:51:45 EST 2014
LINKS

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

#2 by R. H. Hardin at Wed Dec 17 08:51:28 EST 2014
NAME

allocated for R. H. Hardin

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

DATA

1966, 771, 663, 744, 916, 1097, 1361, 1791, 2270, 2976, 4082, 5341, 7204, 10080, 13381, 18273, 25783, 34430, 47252, 66894, 89537, 123120, 174524, 233809, 321745, 456303, 611518, 841752, 1194010, 1600373, 2203148, 3125352, 4189229, 5767329

OFFSET

1,1

COMMENTS

Column 4 of A252384

FORMULA

Empirical: a(n) = 4*a(n-3) -4*a(n-6) +a(n-9) for n>12

EXAMPLE

Some solutions for n=4

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

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

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

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

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

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

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Dec 17 2014

STATUS

approved

editing

#1 by R. H. Hardin at Wed Dec 17 08:41:46 EST 2014
NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved