The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A301322

Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
(history; published version)

#4 by R. H. Hardin at Sun Mar 18 08:31:56 EDT 2018

STATUS

editing

approved

#3 by R. H. Hardin at Sun Mar 18 08:31:53 EDT 2018

LINKS

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

#2 by R. H. Hardin at Sun Mar 18 08:31:39 EDT 2018

NAME

allocated for R. H. Hardin

Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

DATA

64, 1063, 1844, 3996, 8035, 15802, 31172, 62375, 126931, 262036, 546825, 1149471, 2427928, 5143628, 10917376, 23198890, 49332845, 104956579, 223369135, 475481242, 1012314623, 2155517305, 4590185451, 9775585602, 20820114408

OFFSET

1,1

COMMENTS

Column 7 of A301323.

FORMULA

Empirical: a(n) = 5*a(n-1) -7*a(n-2) -a(n-3) +10*a(n-4) -14*a(n-5) +17*a(n-6) -13*a(n-7) +10*a(n-8) -6*a(n-9) -5*a(n-10) +7*a(n-11) -2*a(n-12) -2*a(n-13) +5*a(n-14) -7*a(n-15) +4*a(n-16) -2*a(n-17) +2*a(n-18) +2*a(n-20) -2*a(n-21) +a(n-22) -a(n-23) for n>28

EXAMPLE

Some solutions for n=5

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

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

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

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

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

CROSSREFS

Cf. A301323.

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin, Mar 18 2018

STATUS

approved

editing

#1 by R. H. Hardin at Sun Mar 18 08:28:38 EDT 2018

NAME

allocated for R. H. Hardin

KEYWORD

allocated

STATUS

approved